On reachable assignments under dichotomous preferences

Ito, T; Kakimura, N; Kamiyama, N; Kobayashi, Y; Nozaki, Y; Okamoto, Y; Ozeki, K

Kamiyama, N (通讯作者),Kyushu Univ, Inst Math Ind, Fukuoka, Japan.

THEORETICAL COMPUTER SCIENCE, 2023; 979 ():

Abstract

We consider the problem of determining whether a target item assignment can be reached from an initial item assignment by a sequence of pairwise excha......

Full Text Link