Szczegóły publikacji
Opis bibliograficzny
Committee scoring rules: axiomatic classification and hierarchy / Piotr FALISZEWSKI, Piotr Skowron, Arkadii Slinko, Nimrod Talmon // W: IJCAI-16 [Dokument elektroniczny] : proceedings of the twenty-fifth International Joint Conference on Artificial Intelligence : New York, USA 9–15 July 2016 / ed. Subbarao Kambhampati. — Wersja do Windows. — Dane tekstowe. — Palo Alto, USA : AAAI Press / International Joint Conferences on Artificial Intelligence, 2016. — ISBN: 978-1-57735-770-4; e-ISBN: 978-1-57735-771-1. — S. 250–256. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://www.ijcai.org/Proceedings/16/Papers/043.pdf [2016-10-14]. — Bibliogr. s. 256, Abstr.
Autorzy (4)
- AGHFaliszewski Piotr
- Skowron Piotr
- Slinko Arkadii
- Talmon Nimrod
Dane bibliometryczne
| ID BaDAP | 101395 |
|---|---|
| Data dodania do BaDAP | 2016-11-05 |
| Rok publikacji | 2016 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Joint Conference on Artificial Intelligence 2016 |
Abstract
We consider several natural classes of committee scoring rules, namely, weakly separable, representation-focused, top-k-counting, OWA based, and decomposable rules. We study some of their axiomatic properties, especially properties of monotonicity, and concentrate on containment relations between them. We characterize SNTV, Bloc, and k-approval Chamberlin-Courant, as the only rules in certain intersections of these classes. We introduce decomposable rules, describe some of their applications, and show that the class of decomposable rules strictly contains the class of OWA-based rules.
