Incomplete Preferences in Single-Peaked Electorates

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.

Authors

• Martin Lackner Univ. of Applied Sciences St. Pölten

Keywords

No keywords are indexed for this paper.