2021/12/20 by Martin Lackner, Piotr Skowron, Lackner, Martin +1 · 1 citation
Computer Science · Decision Sciences · Economics, Econometrics and Finance · Mathematics · #Advanced Algebra and Logic #Artificial intelligence #Auction Theory and Applications #Axiom #Axiomatic system #Class (philosophy) #Computer Science and Game Theory (cs.GT) #Computer science #Consistency (knowledge bases) #Discrete mathematics #Epistemology #FOS: Computer and information sciences #Game Theory and Voting Systems #Law #Mathematical economics #Mathematics #Political science #Programming language #Property (philosophy) #Set (abstract data type) #Voting
paper · pdf · doi:10.48550/arxiv.2112.10407
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2021/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove axiomatic characterizations of several important multiwinner rules within the class of approval-based committee choice rules. These are voting rules that return a set of (fixed-size) committees. In particular, we provide axiomatic characterizations of Proportional Approval Voting, the Chamberlin--Courant rule, and other Thiele methods. These rules share the important property that they satisfy an axiom called consistency, which is crucial in our characterizations.