OWA-Based Extensions of the Chamberlin–Courant Rule

DOI10.1007/978-3-319-23114-3_29zbMath1405.91150OpenAlexW2293358884MaRDI QIDQ3449553

Edith Elkind, Anisse Ismaili

Publication date: 4 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-23114-3_29

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (6)

Properties of multiwinner voting rules ⋮ Finding a collective set of items: from proportional multirepresentation to group recommendation ⋮ Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ Structured proportional representation ⋮ Maximizing Social Welfare in Score-Based Social Distance Games

This page was built for publication: OWA-Based Extensions of the Chamberlin–Courant Rule