Abstract
Distance rationalizability is a framework for classifying voting rules by interpreting them in terms of distances and consensus classes. It can also be used to design new voting rules with desired properties. A particularly natural and versatile class of distances that can be used for this purpose is that of votewise distances [12], which "lift" distances over individual votes to distances over entire elections using a suitable norm. In this paper, we continue the investigation of the properties of votewise distance-rationalizable rules initiated in [12]. We describe a number of general conditions on distances and consensus classes that ensure that the resulting voting rule is homogeneous or monotone. This complements the results of [12], where the authors focus on anonymity, neutrality and consistency. We also introduce a new class of voting rules, that can be viewed as "majority variants" of classic scoring rules, and have a natural interpretation in the context of distance rationalizability.
Original language | English (US) |
---|---|
Pages | 769-776 |
Number of pages | 8 |
State | Published - 2011 |
Event | 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 - Taipei, Taiwan, Province of China Duration: May 2 2011 → May 6 2011 |
Other
Other | 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 |
---|---|
Country/Territory | Taiwan, Province of China |
City | Taipei |
Period | 5/2/11 → 5/6/11 |
Keywords
- Distance rationalizability
- Homogeneity
- Monotonicity
- Voting
ASJC Scopus subject areas
- Artificial Intelligence