Arrow's Impossibility Theorem Without Unanimity
Computer Science and Game Theory
2009-10-05 v5 Discrete Mathematics
Abstract
Arrow's Impossibility Theorem states that any constitution which satisfies Transitivity, Independence of Irrelevant Alternatives (IIA) and Unanimity is a dictatorship. Wilson derived properties of constitutions satisfying Transitivity and IIA for unrestricted domains where ties are allowed. In this paper we consider the case where only strict preferences are allowed. In this case we derive a new short proof of Arrow theorem and further obtain a new and complete characterization of all functions satisfying Transitivity and IIA.
Cite
@article{arxiv.0901.4727,
title = {Arrow's Impossibility Theorem Without Unanimity},
author = {Elchanan Mossel},
journal= {arXiv preprint arXiv:0901.4727},
year = {2009}
}
Comments
Most of the new results in the Arxiv sumbission now appear in a follow up paper on quantitative Arrow's theorem