TY - GEN
T1 - On Reachable Assignments Under Dichotomous Preferences
AU - Ito, Takehiro
AU - Kakimura, Naonori
AU - Kamiyama, Naoyuki
AU - Kobayashi, Yusuke
AU - Nozaki, Yuta
AU - Okamoto, Yoshio
AU - Ozeki, Kenta
N1 - Funding Information:
Keywords: Item assignment · Dichotomous preference · Combinatorial reconfiguration The full version is available at arXiv (arXiv:2209.10262). This work was supported by JSPS KAKENHI Grant Numbers JP18H04091, JP19K11814, JP20H05793, JP20H05795, JP21H03397, JP19H05485, JP20K14317, JP20K11670, JP18K03391, JP22H05001.
Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - We consider the problem of determining whether a target item assignment can be reached from an initial item assignment by a sequence of pairwise exchanges of items between agents. In particular, we consider the situation where each agent has a dichotomous preference over the items, that is, each agent evaluates each item as acceptable or unacceptable. Furthermore, we assume that communication between agents is limited, and the relationship is represented by an undirected graph. Then, a pair of agents can exchange their items only if they are connected by an edge and the involved items are acceptable. We prove that this problem is PSPACE -complete even when the communication graph is complete (that is, every pair of agents can exchange their items), and this problem can be solved in polynomial time if an input graph is a tree.
AB - We consider the problem of determining whether a target item assignment can be reached from an initial item assignment by a sequence of pairwise exchanges of items between agents. In particular, we consider the situation where each agent has a dichotomous preference over the items, that is, each agent evaluates each item as acceptable or unacceptable. Furthermore, we assume that communication between agents is limited, and the relationship is represented by an undirected graph. Then, a pair of agents can exchange their items only if they are connected by an edge and the involved items are acceptable. We prove that this problem is PSPACE -complete even when the communication graph is complete (that is, every pair of agents can exchange their items), and this problem can be solved in polynomial time if an input graph is a tree.
UR - http://www.scopus.com/inward/record.url?scp=85142732737&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85142732737&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-21203-1_43
DO - 10.1007/978-3-031-21203-1_43
M3 - Conference contribution
AN - SCOPUS:85142732737
SN - 9783031212024
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 650
EP - 658
BT - PRIMA 2022
A2 - Aydoğan, Reyhan
A2 - Criado, Natalia
A2 - Sanchez-Anguix, Victor
A2 - Lang, Jérôme
A2 - Serramia, Marc
PB - Springer Science and Business Media Deutschland GmbH
T2 - 24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020
Y2 - 16 November 2022 through 18 November 2022
ER -