Computer Science – Computer Science and Game Theory
Scientific paper
2009-01-29
Computer Science
Computer Science and Game Theory
Most of the new results in the Arxiv sumbission now appear in a follow up paper on quantitative Arrow's theorem
Scientific paper
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.
No associations
LandOfFree
Arrow's Impossibility Theorem Without Unanimity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Arrow's Impossibility Theorem Without Unanimity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arrow's Impossibility Theorem Without Unanimity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-13921