Szczegóły publikacji
Opis bibliograficzny
Voting-based group formation / Piotr FALISZEWSKI, 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. 243–249. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://www.ijcai.org/Proceedings/16/Papers/042.pdf [2016-10-14]. — Bibliogr. s. 248–249, Abstr.
Autorzy (3)
- AGHFaliszewski Piotr
- Slinko Arkadii
- Talmon Nimrod
Dane bibliometryczne
| ID BaDAP | 101396 |
|---|---|
| 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 study a combinatorial problem formulated in terms of the following group-formation scenario. Given some agents, where each agent has preferences over the set of potential group leaders, the task is to partition the agents into groups and assign a group leader to each of them, so that the group leaders have as high support as possible from the groups they are assigned to lead. We model this scenario as a voting problem, where the goal is to partition a set of voters into a prescribed number of groups so that each group elects its leader, i.e., their leader is a unique winner in the corresponding election. We study the computational complexity of this problem (and several of its variants) for Approval elections.
