Achievable Hierarchies In Voting Games

Theory and Decision 61 (4):305-318 (2006)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-10-31

Downloads
50 (#316,086)

6 months
15 (#163,632)

Historical graph of downloads
How can I increase my downloads?