The Complexity of Multiwinner Voting Rules with Variable Number of Winners

Faliszewski, P; Slinko, Arkadii; Talmon, N

dc.contributor.author	Faliszewski, P	en
dc.contributor.author	Slinko, Arkadii	en
dc.contributor.author	Talmon, N	en
dc.date.accessioned	2018-10-08T19:39:24Z	en
dc.date.issued	2017-11-20	en
dc.identifier.citation	20 Nov 2017. archiv.org. 15 pages	en
dc.identifier.uri	http://hdl.handle.net/2292/39482	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	archiv.org	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	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.rights.uri	http://arxiv.org/licenses/nonexclusive-distrib/1.0/	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
pubs.author-url	http://arxiv.org/abs/1711.06641v1	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en
pubs.subtype	Working Paper	en
pubs.elements-id	717109	en
pubs.org-id	Science	en
pubs.org-id	Mathematics	en
pubs.arxiv-id	1711.06641	en
pubs.number	arXiv:1711.06641	en
pubs.record-created-at-source-date	2019-03-11	en