Minisum and minimax committee election rules for general preference types

Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann Kathrin Selker

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

In committee elections it is often assumed that voters only (dis)approve of each candidate or that they rank all candidates, as it is common for single-winner elections. We suggest an intermediate approach, where the voters rank the candidates into a fixed number of groups. This allows more diverse votes than approval votes, but leaves more freedom than in a linear order. A committee is then elected by applying the minisum or minimax approach to minimize the voters' dissatisfaction. We study the axiomatic properties of these committee election rules as well as the complexity of winner determination and show fixed-parameter tractability for our minimax rules.

Original languageEnglish
Title of host publicationFrontiers in Artificial Intelligence and Applications
EditorsGal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hullermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen
PublisherIOS Press BV
Pages1656-1657
Number of pages2
ISBN (Electronic)9781614996712
DOIs
StatePublished - 2016
Externally publishedYes
Event22nd European Conference on Artificial Intelligence, ECAI 2016 - The Hague, Netherlands
Duration: 29 Aug 20162 Sep 2016

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume285
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314

Conference

Conference22nd European Conference on Artificial Intelligence, ECAI 2016
Country/TerritoryNetherlands
CityThe Hague
Period29/08/162/09/16

Bibliographical note

Publisher Copyright:
© 2016 The Authors and IOS Press.

Fingerprint

Dive into the research topics of 'Minisum and minimax committee election rules for general preference types'. Together they form a unique fingerprint.

Cite this