Szczegóły publikacji
Opis bibliograficzny
The complexity of subelection isomorphism problems / Piotr FALISZEWSKI, Krzysztof SORNAT, Stanisław SZUFA // W: AAAI-22 / IAAI-22 / EAAI-22 proceedings : thirty-sixth AAAI Conference on Artificial Intelligence; thirty-fourth Conference on Innovative Applications of Artificial Intelligence; the twelveth Symposium on Educational Advances in Artificial Intelligence : February 22 – March 1, 2022, held virtually, Palo Alto, California, USA. — Palo Alto : AAAI Press, cop. 2022. — (Proceedings of the ... AAAI Conference on Artificial Intelligence ; ISSN 2159-5399 ; Vol. 36 No. 5: AAAI-22 Technical Tracks 5 ). — ISBN - wspólny dla 11 vol. — ISBN: 978-1-57735-876-3; ISBN: 1-57735-876-7. — S. 4991–4998. — Bibliogr. s. 4998, Abstr. — S. Szufa - dod. afiliacja: Jagiellonian University, Kraków, Poland
Autorzy (3)
Dane bibliometryczne
| ID BaDAP | 142802 |
|---|---|
| Data dodania do BaDAP | 2022-10-10 |
| DOI | 10.1609/aaai.v36i5.20430 |
| Rok publikacji | 2022 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencje | National Conference of the American Association for Artificial Intelligence 2022, Innovative Applications in AI 2022 |
| Czasopismo/seria | Proceedings of the ... AAAI Conference on Artificial Intelligence |
Abstract
We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational complexity and approximability. Using our problems in experiments, we provide some insights into the nature of several statistical models of elections.
