We use a simple graphical approach to represent Social Welfare Functions that satisfy Independence of Irrelevant Alternatives and Anonymity. This approach allows us to provide simple and illustrative proofs of May's Theorem, of variants of classic impossibility results, and of a recent result on...

We use a simple graphical approach to represent Social Welfare Functions that satisfy Independence of Irrelevant Alternatives and Anonymity. This approach allows us to provide simple and illustrative proofs of May's Theorem, of variants of classic impossibility results, and of a recent result on...

Approval voting has attracted considerable interest among voting theorists, but they have rarely investigated it in the Arrovian frame-work of social welfare functions (SWF) and never connected it with Arrow's impossibility theorem. This note explores these two directions. Assuming that voters...

Arrow's theorem proves that no voting procedure can meet certain conditions of both fairness and logic. In this note, Grant Hayden explores the ramifications of the theorem for qualitative vote dilution. After describing Arrow's argument, Mr. Hayden considers four democratic voting procedures...