Papers
Topics
Authors
Recent
Search
2000 character limit reached

Non-Borda elections under relaxed IIA conditions

Published 22 Aug 2024 in cs.GT | (2408.12661v1)

Abstract: Arrow's celebrated Impossibility Theorem asserts that an election rule, or Social Welfare Function (SWF), between three or more candidates meeting a set of strict criteria cannot exist. Maskin suggests that Arrow's conditions for SWFs are too strict. In particular he weakens the "Independence of Irrelevant Alternatives" condition (IIA), which states that if in two elections, each voter's binary preference between candidates $c_i$ and $c_j$ is the same, then the two results must agree on their preference between $c_i$ and $c_j$. Instead, he proposes a modified IIA condition (MIIA). Under this condition, the result between $c_i$ and $c_j$ can be affected not just by the order of $c_i$ and $c_j$ in each voter's ranking, but also the number of candidates between them. More candidates between $c_i$ and $c_j$ communicates some information about the strength of a voter's preference between the two candidates, and Maskin argues that it should be admissible evidence in deciding on a final ranking. We construct SWFs for three-party elections which meet the MIIA criterion along with other sensibility criteria, but are far from being Borda elections (where each voter assigns a score to each candidate linearly according to their ranking). On the other hand, we give cases in which any SWF must be the Borda rule.

Authors (1)
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.