Optimal algorithms for multiwinner elections and the Chamberlin-Courant rule

DOI10.1007/S00355-024-01555-WMaRDI QIDQ7014367zbMATH OpenFDO

Authors Kamesh Munagala, Zeyu Shen, Kangning Wang

Publication date 11 March 2025

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00355-024-01555-W

Mathematics Subject Classification ID

Social choice (91B14) Voting theory (91B12)

Cites work

• A constant factor approximation algorithm for fault-tolerant k-median
• A constant-factor approximation algorithm for the k-median problem
• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Approximately stable committee selection
• Approximating optimal social choice under metric preferences
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Breaking the metric voting distortion barrier
• Dependent rounding and its applications to approximation algorithms
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Local Search Heuristics for k-Median and Facility Location Problems
• Mathematical Properties of the Banzhaf Power Index
• On the simulataneous election of several candidates.
• Properties of multiwinner voting rules
• Proportional approval voting, harmonic \(k\)-median, and negative association
• Resolving the optimal metric distortion conjecture
• The expanding approvals rule: improving proportional representation and monotonicity
• Tight approximation bounds for maximum multi-coverage

This page was built for publication: Optimal algorithms for multiwinner elections and the Chamberlin-Courant rule

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