Phragmén's voting methods and justified representation

DOI10.1007/S10107-023-01926-8MaRDI QIDQ6120935zbMATH OpenFDO

Authors Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner

Publication date 21 February 2024

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Social choice (91B14)

Abstract: In the late 19th century, Swedish mathematician Lars Edvard Phragm'{e}n proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two optimization variants - one minimizing the maximal load and one minimizing the variance of loads - and a sequential variant. We study Phragm'{e}n's methods from an axiomatic point of view, focusing on properties capturing proportional representation. We show that the sequential variant satisfies proportional justified representation, which is a rare property for committee monotonic methods. Moreover, we show that the optimization variants satisfy perfect representation. We also analyze the computational complexity of Phragm'{e}n's methods and provide mixed-integer programming based algorithms for computing them.

Recommendations

• Elections by means of approval voting. Phragmen's method and some variants of it
• Justified representation in approval-based committee voting
• The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections
• Approval-based apportionment

Cites work

• Approval balloting for multi-winner elections
• Approval-based apportionment
• Elections by means of approval voting. Phragmen's method and some variants of it
• Fast multiplication of large numbers
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Gösta Mittag-Leffler
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 44383 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Justified representation in approval-based committee voting
• Mixed-integer quadratic programming is in NP
• Modern computer arithmetic
• On Direct Methods for Lexicographic Min-Max Optimization
• On Schönhage's algorithm and subquadratic integer gcd computation
• On the complexity of achieving proportional representation
• On the computation of fully proportional representation
• On the lexicographic minimax approach to location problems
• Properties of multiwinner voting rules
• Proportional representation. Apportionment methods and their applications. With a foreword by Andrew Duff
• Some simplified NP-complete graph problems
• The expanding approvals rule: improving proportional representation and monotonicity
• The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections
• The Nucleolus of a Characteristic Function Game

Cited in

(8)

• The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections
• Approval-based committee voting under incomplete information
• A note on the method of equal shares
• Dynamic proportional rankings
• Individual representation in approval-based committee voting
• Proportional justified representation
• A lower bound for local search proportional approval voting
• Proportional aggregation of preferences for sequential decision making

This page was built for publication: Phragmén's voting methods and justified representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120935)