Conference item
On swap convexity of voting rules
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, 228.1KB, Terms of use)
-
- Publisher copy:
- 10.1609/aaai.v34i02.5560
- Publication website:
- https://ojs.aaai.org//index.php/AAAI/article/view/5560
Authors
- Publisher:
- AAAI Press
- Host title:
- Proceedings of the AAAI Conference on Artificial Intelligence
- Volume:
- 34
- Issue:
- 2
- Pages:
- 1910-1917
- Publication date:
- 2020-04-03
- Acceptance date:
- 2020-11-10
- Event title:
- Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-2020)
- Event location:
- New York, USA
- Event website:
- https://aaai.org/Conferences/AAAI-20/
- Event start date:
- 2020-02-07
- Event end date:
- 2020-02-12
- DOI:
- ISBN:
- 9781577358350
- Language:
-
English
- Keywords:
- Pubs id:
-
1112736
- Local pid:
-
pubs:1112736
- Deposit date:
-
2021-04-19
Terms of use
- Copyright holder:
- Association for the Advancement of Artificial Intelligence
- Copyright date:
- 2020
- Rights statement:
- Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
- Notes:
- This paper was presented at the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-2020), 7-12 February 2020, New York, USA. This is the accepted manuscript version of the paper. The final version is available online from AAAI Press at: https://doi.org/10.1609/aaai.v34i02.5560
If you are the owner of this record, you can report an update to it here: Report update to this record