Phragmén's voting methods and justified representation

DOI10.1007/s10107-023-01926-8arXiv2102.12305MaRDI QIDQ6120935

Markus Brill, Svante Janson, Rupert Freeman, Martin Lackner

Publication date: 21 February 2024

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

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

Mathematics Subject Classification ID

Social choice (91B14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Mixed-integer quadratic programming is in NP
• Some simplified NP-complete graph problems
• On the lexicographic minimax approach to location problems
• The expanding approvals rule: improving proportional representation and monotonicity
• Justified representation in approval-based committee voting
• On the complexity of achieving proportional representation
• Fast multiplication of large numbers
• Properties of multiwinner voting rules
• Approval Balloting for Multi-winner Elections
• On the Computation of Fully Proportional Representation
• Proportional Representation
• Modern Computer Arithmetic
• Gösta Mittag-Leffler
• On Direct Methods for Lexicographic Min-Max Optimization
• On Schönhage's algorithm and subquadratic integer gcd computation
• The Nucleolus of a Characteristic Function Game
• The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections
• Approval-based apportionment

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