The Complexity of Fully Proportional Representation for Single-Crossing Electorates

DOI10.1007/978-3-642-41392-6_1zbMath1319.91074arXiv1307.1252OpenAlexW2252931728MaRDI QIDQ2856127

Piotr Skowron, Edith Elkind, Piotr Faliszewski, Lan Yu

Publication date: 23 October 2013

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.1252

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Social choice (91B14)

Related Items

Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System ⋮ Condorcet winning sets