Multiwinner rules on paths from k-Borda to Chamberlin-Courant

Piotr Faliszewski; Piotr Skowron; Arkadii Slinko; Nimrod Talmon

doi:10.24963/ijcai.2017/28

Multiwinner rules on paths from k-Borda to Chamberlin-Courant

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

24 Scopus citations

Abstract

The classical multiwinner rules are designed for particular purposes. For example, variants of k-Borda are used to find k best competitors in judging contests while the Chamberlin-Courant rule is used to select a diverse set of k products. These rules represent two extremes of the multiwinner world. At times, however, one might need to find an appropriate trade-off between these two extremes. We explore continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules.

Original language	English
Title of host publication	26th International Joint Conference on Artificial Intelligence, IJCAI 2017
Editors	Carles Sierra
Publisher	International Joint Conferences on Artificial Intelligence
Pages	192-198
Number of pages	7
ISBN (Electronic)	9780999241103
DOIs	https://doi.org/10.24963/ijcai.2017/28
State	Published - 1 Jan 2017
Externally published	Yes
Event	26th International Joint Conference on Artificial Intelligence, IJCAI 2017 - Melbourne, Australia Duration: 19 Aug 2017 → 25 Aug 2017

Publication series

Name	IJCAI International Joint Conference on Artificial Intelligence
Volume	0
ISSN (Print)	1045-0823

Conference

Conference	26th International Joint Conference on Artificial Intelligence, IJCAI 2017
Country/Territory	Australia
City	Melbourne
Period	19/08/17 → 25/08/17

ASJC Scopus subject areas

Artificial Intelligence

Access to Document

10.24963/ijcai.2017/28

Cite this

Faliszewski, P., Skowron, P., Slinko, A., & Talmon, N. (2017). Multiwinner rules on paths from k-Borda to Chamberlin-Courant. In C. Sierra (Ed.), 26th International Joint Conference on Artificial Intelligence, IJCAI 2017 (pp. 192-198). (IJCAI International Joint Conference on Artificial Intelligence; Vol. 0). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/28

Faliszewski, Piotr ; Skowron, Piotr ; Slinko, Arkadii et al. / Multiwinner rules on paths from k-Borda to Chamberlin-Courant. 26th International Joint Conference on Artificial Intelligence, IJCAI 2017. editor / Carles Sierra. International Joint Conferences on Artificial Intelligence, 2017. pp. 192-198 (IJCAI International Joint Conference on Artificial Intelligence).

@inproceedings{024ffb929a9d44aaa20acd589eaa994c,

title = "Multiwinner rules on paths from k-Borda to Chamberlin-Courant",

abstract = "The classical multiwinner rules are designed for particular purposes. For example, variants of k-Borda are used to find k best competitors in judging contests while the Chamberlin-Courant rule is used to select a diverse set of k products. These rules represent two extremes of the multiwinner world. At times, however, one might need to find an appropriate trade-off between these two extremes. We explore continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules.",

author = "Piotr Faliszewski and Piotr Skowron and Arkadii Slinko and Nimrod Talmon",

note = "Funding Information: ∗Piotr Faliszewski was supported by the National Science Centre, Poland, under project 2016/21/B/ST6/01509, Piotr Skowron was supported by a Humboldt Research Fellowship for Postdoctoral Researchers, Arkadii Slinko was supported by the Royal Society of NZ Marsden Fund UOA-254.; 26th International Joint Conference on Artificial Intelligence, IJCAI 2017 ; Conference date: 19-08-2017 Through 25-08-2017",

year = "2017",

month = jan,

day = "1",

doi = "10.24963/ijcai.2017/28",

language = "English",

series = "IJCAI International Joint Conference on Artificial Intelligence",

publisher = "International Joint Conferences on Artificial Intelligence",

pages = "192--198",

editor = "Carles Sierra",

booktitle = "26th International Joint Conference on Artificial Intelligence, IJCAI 2017",

}

Faliszewski, P, Skowron, P, Slinko, A & Talmon, N 2017, Multiwinner rules on paths from k-Borda to Chamberlin-Courant. in C Sierra (ed.), 26th International Joint Conference on Artificial Intelligence, IJCAI 2017. IJCAI International Joint Conference on Artificial Intelligence, vol. 0, International Joint Conferences on Artificial Intelligence, pp. 192-198, 26th International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19/08/17. https://doi.org/10.24963/ijcai.2017/28

Multiwinner rules on paths from k-Borda to Chamberlin-Courant. / Faliszewski, Piotr; Skowron, Piotr; Slinko, Arkadii et al.
26th International Joint Conference on Artificial Intelligence, IJCAI 2017. ed. / Carles Sierra. International Joint Conferences on Artificial Intelligence, 2017. p. 192-198 (IJCAI International Joint Conference on Artificial Intelligence; Vol. 0).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Multiwinner rules on paths from k-Borda to Chamberlin-Courant

AU - Faliszewski, Piotr

AU - Skowron, Piotr

AU - Slinko, Arkadii

AU - Talmon, Nimrod

N1 - Funding Information: ∗Piotr Faliszewski was supported by the National Science Centre, Poland, under project 2016/21/B/ST6/01509, Piotr Skowron was supported by a Humboldt Research Fellowship for Postdoctoral Researchers, Arkadii Slinko was supported by the Royal Society of NZ Marsden Fund UOA-254.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The classical multiwinner rules are designed for particular purposes. For example, variants of k-Borda are used to find k best competitors in judging contests while the Chamberlin-Courant rule is used to select a diverse set of k products. These rules represent two extremes of the multiwinner world. At times, however, one might need to find an appropriate trade-off between these two extremes. We explore continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules.

AB - The classical multiwinner rules are designed for particular purposes. For example, variants of k-Borda are used to find k best competitors in judging contests while the Chamberlin-Courant rule is used to select a diverse set of k products. These rules represent two extremes of the multiwinner world. At times, however, one might need to find an appropriate trade-off between these two extremes. We explore continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules.

UR - http://www.scopus.com/inward/record.url?scp=85031913707&partnerID=8YFLogxK

U2 - 10.24963/ijcai.2017/28

DO - 10.24963/ijcai.2017/28

M3 - Conference contribution

AN - SCOPUS:85031913707

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 192

EP - 198

BT - 26th International Joint Conference on Artificial Intelligence, IJCAI 2017

A2 - Sierra, Carles

PB - International Joint Conferences on Artificial Intelligence

T2 - 26th International Joint Conference on Artificial Intelligence, IJCAI 2017

Y2 - 19 August 2017 through 25 August 2017

ER -

Faliszewski P, Skowron P, Slinko A, Talmon N. Multiwinner rules on paths from k-Borda to Chamberlin-Courant. In Sierra C, editor, 26th International Joint Conference on Artificial Intelligence, IJCAI 2017. International Joint Conferences on Artificial Intelligence. 2017. p. 192-198. (IJCAI International Joint Conference on Artificial Intelligence). doi: 10.24963/ijcai.2017/28

Multiwinner rules on paths from k-Borda to Chamberlin-Courant

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this