Arrow's impossibility theorem: Two simple single-profile versions
Allan M. Feldman
In this short paper we provide two simple new versions of Arrow's impossibility theorem, in a world with only one preference profile. Both versions are extremely transparent. The first version assumes a two-agent society; the second version, which is similar to a theorem of Pollak, assumes two or more agents. Both of our theorems rely on diversity of preferences axioms, and we explore alternative notions of diversity at length. Our first theorem also uses a neutrality assumption, commonly used in the literature; our second theorem uses a neutrality/monotonicity assumption, which is stronger and less commonly used. We provide examples to show the logical independence of the axioms, and to illustrate our points.
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.