Talks and Poster Presentations (with Proceedings-Entry):
"Incomplete Preferences in Single-Peaked Electorates";
Talk: Twenty-Eighth AAAI Conference on Aritifical Intelligence (AAAI 2014),
Québec City, Québec, Canada;
- 07-31-2014; in: "Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence",
C. Brodley, P. Stone (ed.);
Incomplete preferences are likely to arise in real-world preference aggregation and voting systems. This paper deals with determining whether an incomplete preference profile is single-peaked. This is essential information since many intractable voting problems become tractable for single-peaked profiles. We prove that for incomplete profiles the problem of determining single-peakedness is NP-complete. Despite this computational hardness result, we find four polynomial-time algorithms for reasonably restricted settings.
Created from the Publication Database of the Vienna University of Technology.