Conference item icon

Conference item

OWA-based extensions of the Chamberlin–Courant rule

Abstract:

Given a set of voters V, a set of candidates C, and voters’ preferences over the candidates, multiwinner voting rules output a fixed-size subset of candidates (committee). Under the Chamberlin–Courant multiwinner voting rule, one fixes a scoring vector of length |C|, and each voter’s ‘utility’ for a given committee is defined to be the score that she assigns to her most preferred candidate in that committee; the goal is then to find a committee that maximizes the joint utility of all voters. ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
  • (Accepted manuscript, pdf, 340.3KB)
Publisher copy:
10.1007/978-3-319-23114-3_29

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Balliol College
Role:
Author
Publisher:
Springer
Host title:
Lecture Notes in Computer Science: Algorithmic Decision Theory
Journal:
Lecture Notes in Computer Science: Algorithmic Decision Theory More from this journal
Volume:
9346
Pages:
486-502
Publication date:
2015-08-28
DOI:
ISSN:
0302-9743 and 1611-3349
ISBN:
9783319231143
Keywords:
Pubs id:
pubs:575695
UUID:
uuid:22baf976-e250-4ece-9c31-d7b41b36e807
Local pid:
pubs:575695
Source identifiers:
575695
Deposit date:
2018-07-07

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP