Szczegóły publikacji
Opis bibliograficzny
On swap convexity of voting rules / Svetlana Obraztsova, Edith Elkind, Piotr FALISZEWSKI // W: AAAI-20 / IAAI-20 / EAAI-20 proceedings : thirty-fourth AAAI conference on Artificial Intelligence, thirty-second conference on Innovative Applications of Artificial Intelligence, the tenth symposium on Educational Advances in Artificial Intelligence : February 7–12th, 2020, New York. — Palo Alto : AAAI Press, cop. 2020. — (Proceedings of the ... AAAI Conference on Artificial Intelligence ; ISSN 2159-5399 ; vol 34 no. 02: AAAI-20 Technical Tracks 2). — ISBN: 978-1-57735-835-0. — S. 1910–1917. — Bibliogr. s. 1917, Abstr.
Autorzy (3)
- Obraztsova Svetlana
- Elkind Edith
- AGHFaliszewski Piotr
Dane bibliometryczne
| ID BaDAP | 130854 |
|---|---|
| Data dodania do BaDAP | 2020-11-04 |
| Tekst źródłowy | URL |
| DOI | 10.1609/aaai.v34i02.5560 |
| Rok publikacji | 2020 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencje | National Conference of the American Association for Artificial Intelligence 2020, Innovative Applications in AI 2020 |
| Czasopismo/seria | Proceedings of the ... AAAI Conference on Artificial Intelligence |
Abstract
Obraztsova et al. (2013) have recently proposed an intriguing convexity axiom for voting rules. This axiom imposes conditions on the shape of the sets of elections with a given candidate as a winner. However, this new axiom is both too weak and too strong: it is too weak because it defines a set to be convex if for any two elements of the set some shortest path between them lies within the set, whereas the standard definition of convexity requires all shortest paths between two elements to lie within the set, and it is too strong because common voting rules do not satisfy this axiom. In this paper, we (1) propose several families of voting rules that are convex in the sense of Obraztsova et al.; (2) put forward a weaker notion of convexity that is satisfied by most common voting rules; (3) prove impossibility results for a variant of this definition that considers all, rather than some shortest paths.
