Combinatorial and computational aspects of multiple weighted voting games
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified quota. We provide a mathematical and computational characterization of multiple weighted voting games which are an extension of weighted voting games1. We analyse the structure of multiple weighted voting games and some of their combinatorial properties especially with respect to dictatorship, veto power, dummy players and Banzhaf indices. Among other results we extend the concept of amplitude to multiple weighted voting games. An illustrative Mathematica program to compute voting power properties of multiple weighted voting games is also provided.
|Date of creation:||2007|
|Date of revision:|
|Contact details of provider:|| Postal: CV4 7AL COVENTRY|
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:823. 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: (Robyn Till)
If references are entirely missing, you can add them using this form.