Bounded Single-Peaked Width and Proportional Representation

Abstract : This paper is devoted to the proportional representation (PR) problem when the preferences are clustered single-peaked. PR is a “multi-winner” election problem, that we study in Chamberlin and Courant’s scheme [6]. We define clustered single-peakedness as a form of single-peakedness with respect to clusters of candidates, i.e. subsets of candidates that are consecutive (in arbitrary order) in the preferences of all voters. We show that the PR problem becomes polynomial when the size of the largest cluster of candidates (width) is bounded. Furthermore, we establish the polynomiality of determining the single-peaked width of a preference profile (minimum width for a partition of candidates into clusters compatible with clustered single-peakedness) when the preferences are narcissistic (i.e., every candidate is the most preferred one for some voter).
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download
Contributor : Christine Okret-Manville <>
Submitted on : Tuesday, March 28, 2017 - 12:52:58 PM
Last modification on : Thursday, March 21, 2019 - 1:11:54 PM
Document(s) archivé(s) le : Thursday, June 29, 2017 - 4:27:52 PM


Files produced by the author(s)



Denis Cornaz, Lucie Galand, Olivier Spanjaard. Bounded Single-Peaked Width and Proportional Representation. ECAI 2012, 20th European Conference on Artificial Intelligence, Aug 2012, Montpellier, France. pp.270-275, ⟨10.3233/978-1-61499-098-7-270⟩. ⟨hal-01497136⟩



Record views


Files downloads