Szczegóły publikacji
Opis bibliograficzny
Multiwinner rules on paths from k–Borda to Chamberlin-Courant / Piotr FALISZEWSKI, Piotr Skowron, Arkadii Slinko, Nimrod Talmon // W: IJCAI-17 [Dokument elektroniczny] : proceedings of the twenty-sixth International Joint Conference on Artificial Intelligence : Melbourne, Australia 19–25 August 2017 / ed. Carles Sierra. — Wersja do Windows. — Dane tekstowe. — [Melbourne] : International Joint Conferences on Artificial Intelligence, cop. 2017. — e-ISBN: 978-0-9992411-0-3. — S. 192–198. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://www.ijcai.org/proceedings/2017/0028.pdf [2017-09-28]. — Bibliogr. s. 198, Abstr.
Autorzy (4)
- AGHFaliszewski Piotr
- Skowron Piotr
- Slinko Arkadii
- Talmon Nimrod
Dane bibliometryczne
| ID BaDAP | 109091 |
|---|---|
| Data dodania do BaDAP | 2017-10-13 |
| Rok publikacji | 2017 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Joint Conference on Artificial Intelligence 2017 |
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.
