TY - GEN
T1 - Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences
AU - Bredereck, Robert
AU - Chen, Jiehua
AU - Finnendahl, Ugo Paavo
AU - Niedermeier, Rolf
N1 - Publisher Copyright:
© 2017, Springer International Publishing AG.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - The classical Stable Roommate problem asks whether it is possible to pair up an even number of agents such that no two non-paired agents prefer to be with each other rather than with their assigned partners. We investigate Stable Roommate with complete (i.e. every agent can be matched with every other agent) or incomplete preferences, with ties (i.e. two agents are considered of equal value to some agent) or without ties. It is known that in general allowing ties makes the problem NP-complete. We provide algorithms for Stable Roommate that are, compared to those in the literature, more efficient when the input preferences are complete and have some structural property, such as being narcissistic, single-peaked, and single-crossing. However, when the preferences are incomplete and have ties, we show that being single-peaked and single-crossing does not reduce the computational complexity—Stable Roommate remains NP-complete.
AB - The classical Stable Roommate problem asks whether it is possible to pair up an even number of agents such that no two non-paired agents prefer to be with each other rather than with their assigned partners. We investigate Stable Roommate with complete (i.e. every agent can be matched with every other agent) or incomplete preferences, with ties (i.e. two agents are considered of equal value to some agent) or without ties. It is known that in general allowing ties makes the problem NP-complete. We provide algorithms for Stable Roommate that are, compared to those in the literature, more efficient when the input preferences are complete and have some structural property, such as being narcissistic, single-peaked, and single-crossing. However, when the preferences are incomplete and have ties, we show that being single-peaked and single-crossing does not reduce the computational complexity—Stable Roommate remains NP-complete.
UR - http://www.scopus.com/inward/record.url?scp=85032478065&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-67504-6_22
DO - 10.1007/978-3-319-67504-6_22
M3 - Conference contribution
AN - SCOPUS:85032478065
SN - 9783319675039
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 315
EP - 330
BT - Algorithmic Decision Theory - 5th International Conference, ADT 2017, Proceedings
A2 - Rothe, Jorg
PB - Springer Verlag
T2 - 5th International Conference on Algorithmic Decision Theory, ADT 2017
Y2 - 25 October 2017 through 27 October 2017
ER -