Szczegóły publikacji
Opis bibliograficzny
How similar are two elections? / Piotr FALISZEWSKI, Piotr Skowron, Arkadii Slinko, Stanisław Szufa, Nimrod Talmon // W: AAAI-19/IAAI-19/EAAI-19 [Dokument elektroniczny] : thirty-third AAAI conference on Artificial Intelligence, thirty-first conference on Innovative Applications of Artificial Intelligence, the ninth symposium on Educational Advances in Artificial Intelligence : January 27–February 1, 2019, Honolulu, Hawaii, USA : proceedings. — Wersja do Windows. — Dane tekstowe. — Palo Alto : Association for the Advancement of Artificial Intelligence AAAI, cop. 2019. — (Proceedings of the ... AAAI Conference on Artificial Intelligence ; ISSN 2159-5399). — ISBN: 978-1-57735-809-1. — S. 1909–1916. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://aaai.org/ojs/index.php/AAAI/article/view/4017/3895 [2019-10-10]. — Bibliogr. s. 1916, Abstr. — Publikacja dostępna online od: 2019-07-23
Autorzy (5)
- AGHFaliszewski Piotr
- Skowron Piotr
- Slinko Arkadii
- Szufa Stanisław
- Talmon Nimrod
Dane bibliometryczne
| ID BaDAP | 125194 |
|---|---|
| Data dodania do BaDAP | 2019-12-13 |
| Rok publikacji | 2019 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | National Conference of the American Association for Artificial Intelligence 2019 |
| Czasopismo/seria | Proceedings of the ... AAAI Conference on Artificial Intelligence |
Abstract
We introduce the ELECTION ISOMORPHISM problem and a family of its approximate variants, which we refer to as d-ISOMORPHISM DISTANCE (d-ID) problems (where d is a metric between preference orders). We show that ELECTION ISOMORPHISM is polynomial-time solvable, and that the d-ISOMORPHISM DISTANCE problems generalize various classic rank-aggregation methods(e.g., those of Kemeny and Litvak). We establish the complexity of our problems (including their inapproximability) and provide initial experiments regarding the ability to solve them in practice.
