The Complexity of Multiwinner Voting Rules with Variable Number of Winners

ResearchSpace Repository

Show simple item record Faliszewski, P en Slinko, Arkadii en Talmon, N en 2018-10-08T19:39:24Z en 2017-11-20 en
dc.identifier.citation 20 Nov 2017. 15 pages en
dc.identifier.uri en
dc.description.abstract We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning candidates are quite well studied, the study of elections with variable number of winners has only recently been initiated by Kilgour. This paper aims at achieving a better understanding of these rules, their computational complexity, and on scenarios for which they might be applicable. en
dc.publisher en
dc.relation.ispartofseries Archiv en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri en
dc.rights.uri en
dc.subject cs.GT en
dc.subject cs.GT en
dc.title The Complexity of Multiwinner Voting Rules with Variable Number of Winners en
dc.type Report en
dc.rights.holder Copyright: The authors en en
dc.rights.accessrights en
pubs.subtype Working Paper en
pubs.elements-id 717109 en Science en Mathematics en
pubs.arxiv-id 1711.06641 en
pubs.number arXiv:1711.06641 en
pubs.record-created-at-source-date 2019-03-11 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace

Advanced Search