Computing Power Indices for Large Voting Games: A New Algorithm
Voting Power Indices enable the analysis of the distribution of power in a legislature or voting body which uses weighted voting. Although the approach, based on co-operative game theory, has been known for a long time it has not been very widely applied, in part because of the difficulty of computing the indices when there are many players. This paper presents new algorithms for the classical power indices which have been shown to work well in real applications.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1998|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +44 (0) 2476 523202
Fax: +44 (0) 2476 523032
Web page: http://www2.warwick.ac.uk/fac/soc/economics/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wrk:warwec:510. 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: (Helen Neal)
If references are entirely missing, you can add them using this form.