The complexity of fully proportional representation for single-crossing electorates
From MaRDI portal
Publication:2513672
DOI10.1016/j.tcs.2014.12.012zbMath1319.91075OpenAlexW2110060186MaRDI QIDQ2513672
Piotr Faliszewski, Piotr Skowron, Lan Yu, Edith Elkind
Publication date: 28 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.012
Related Items
Properties of multiwinner voting rules ⋮ Are there any nicely structured preference profiles nearby? ⋮ Finding a collective set of items: from proportional multirepresentation to group recommendation ⋮ Justified representation in approval-based committee voting ⋮ The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ A characterization of the single-peaked single-crossing domain ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ Conference Program Design with Single-Peaked and Single-Crossing Preferences ⋮ Robustness among multiwinner voting rules ⋮ Structured preferences: a literature survey ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence of clones as a criterion for voting rules
- Top monotonicity: a common root for single peakedness, single crossing and the median voter result
- Stable matching with preferences derived from a psychological model
- On the complexity of achieving proportional representation
- Single-crossing, strategic voting and the median choice rule
- A characterization of the single-crossing domain
- On the Computation of Fully Proportional Representation
- Intermediate Preferences and the Majority Rule
- An Exploration in the Theory of Optimum Income Taxation