English

Single-Peaked Consistency for Weak Orders Is Easy

Computer Science and Game Theory 2016-06-27 v3 Computational Complexity Multiagent Systems

Abstract

In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is not always comprised of total orders. Often voters have indifference between some of the candidates. In a weak preference order indifference must be transitive. We show that single-peaked consistency for weak orders is in P for three different variants of single-peakedness for weak orders. Specifically, we consider Black's original definition of single-peakedness for weak orders, Black's definition of single-plateaued preferences, and the existential model recently introduced by Lackner. We accomplish our results by transforming each of these single-peaked consistency problems to the problem of determining if a 0-1 matrix has the consecutive ones property.

Cite

@article{arxiv.1406.4829,
  title  = {Single-Peaked Consistency for Weak Orders Is Easy},
  author = {Zack Fitzsimmons},
  journal= {arXiv preprint arXiv:1406.4829},
  year   = {2016}
}

Comments

In Proceedings TARK 2015, arXiv:1606.07295

R2 v1 2026-06-22T04:41:44.175Z