Achievable Hierarchies In Voting Games
Previous work by Diffo Lambo and Moulen [Theory and Decision 53, 313â€“325 (2002)] and Felsenthal and Machover [The Measurement of Voting Power, Edward Elgar Publishing Limited (1998)], shows that all swap preserving measures of voting power are ordinally equivalent on any swap robust simple voting game. Swap preserving measures include the Banzhaf, the Shapleyâ€“Shubik and other commonly used measures of a priori voting power. In this paper, we completely characterize the achievable hierarchies for any such measure on a swap robust simple voting game. Each possible hierarchy can be induced by a weighted voting game and we provide a constructive proof of this result. In particular, the strict hierarchy is always achievable as long as there are at least five players. Copyright Springer 2006
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lawrence Diffo Lambo & Joël Moulen, 2002. "Ordinal equivalence of power notions in voting games," Theory and Decision, Springer, vol. 53(4), pages 313-325, December.
When requesting a correction, please mention this item's handle: RePEc:kap:theord:v:61:y:2006:i:4:p:305-318. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.