2000 character limit reached
Arrow's Impossibility Theorem Without Unanimity
Published 29 Jan 2009 in cs.GT and cs.DM | (0901.4727v5)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.