TY - GEN
T1 - Are there any nicely structured preference profiles nearby?
AU - Bredereck, Robert
AU - Cheny, Jiehua
AU - Woegingerz, Gerhard J.
PY - 2013/12/1
Y1 - 2013/12/1
N2 - We investigate the problem of deciding whether a given preference profile is close to a nicely structured preference profile of a certain type, as for instance single-peaked, single-caved, single-crossing, value-restricted, best-restricted, worst-restricted, medium-restricted, or group-separable profiles. We measure this distance by the number of voters or alternatives that have to be deleted so as to reach a nicely structured profile. Our results classify all considered problem variants with respect to their computational complexity, and draw a clear line between computationally tractable (polynomial time solvable) and computationally intractable (NP-hard) questions.
AB - We investigate the problem of deciding whether a given preference profile is close to a nicely structured preference profile of a certain type, as for instance single-peaked, single-caved, single-crossing, value-restricted, best-restricted, worst-restricted, medium-restricted, or group-separable profiles. We measure this distance by the number of voters or alternatives that have to be deleted so as to reach a nicely structured profile. Our results classify all considered problem variants with respect to their computational complexity, and draw a clear line between computationally tractable (polynomial time solvable) and computationally intractable (NP-hard) questions.
UR - http://www.scopus.com/inward/record.url?scp=84896062266&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84896062266
SN - 9781577356332
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 62
EP - 68
BT - IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence
T2 - 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013
Y2 - 3 August 2013 through 9 August 2013
ER -