Szczegóły publikacji
Opis bibliograficzny
Identifying imperfect clones in elections / Piotr FALISZEWSKI, Łukasz JANECZKO, Grzegorz Lisowski, Kristýna PEKÁRKOVÁ, Ildikó Schlotter // W: AAAI-26 [Dokument elektroniczny] : proceedings of the 40th annual AAAI conference on Artificial Intelligence : thirty-eighth conference on Innovative Applications of Artificial Intelligence : sixteenth symposium on Educational Advances in Artificial Intelligence : January 20-27, 2026, Singapore / eds. Sven Koenig, Chad Jenkins, Matthew E. Taylor ; Association for the Advancement of Artificial Intelligence. — Wersja do Windows. — Dane tekstowe. — Washington, DC, USA : AAAI Press, cop. 2026. — ( Proceedings of the ... AAAI Conference on Artificial Intelligence ; ISSN 2159-5399 ). — e-ISBN: 978-1-57735-906-7; e-ISBN: 1-57735-906-2. — S. 16889–16896. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 16896, Abstr. — Publikacja dostępna online od: 2026-03-14. --- Publikacja w części Technical Tracks 20
Autorzy (5)
- AGHFaliszewski Piotr
- AGHJaneczko Łukasz
- Lisowski Grzegorz
- AGHPekarkova Kristyna
- Schlotter Ildikó
Dane bibliometryczne
| ID BaDAP | 167157 |
|---|---|
| Data dodania do BaDAP | 2026-05-08 |
| Tekst źródłowy | URL |
| DOI | 10.1609/aaai.v40i20.38734 |
| Rok publikacji | 2026 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | National Conference of the American Association for Artificial Intelligence 2026 |
| Czasopismo/seria | Proceedings of the ... AAAI Conference on Artificial Intelligence |
Abstract
A perfect clone in an ordinal election (i.e., an election where the voters rank the candidates in a strict linear order) is a set of candidates that each voter ranks consecutively. We consider different relaxations of this notion: independent or subelection clones are sets of candidates that only some of the voters recognize as a perfect clone, whereas approximate clones are sets of candidates such that every voter ranks their members close to each other, but not necessarily consecutively. We establish the complexity of identifying such imperfect clones, and of partitioning the candidates into families of imperfect clones. We also study the parameterized complexity of these problems with respect to a set of natural parameters such as the number of voters, the size or the number of imperfect clones we are searching for, or their level of imperfection.
