Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Survey of Algorithms for Calculating Power Indices of Weighted Majority Games
 

Summary: A Survey of Algorithms for Calculating Power Indices of
Weighted Majority Games
Tomomi Matsui University of Tokyo,
Bunkyo-ku, Tokyo 113, Japan.
http:==www.misojiro.t.u-tokyo.ac.jp=~tomomi=
Yasuko Matsui Tokai University,
Hiratsuka-shi, Kanagawa, 259-1292, Japan.
http:==www.ss.u-tokai.ac.jp=~yasuko=
Received December 1998;revised August 1999
1. Introdution
In 1944, John von Neumann and Oskar Morgenstern studied the distribution of power in
voting systems in their book Theory of Games and Economic Behavior [19]. They dealt
with a \simple game" in which the only goal is \winning". This is an abstraction of the
constitutional political machinery for voting. This paper deals with the weighted majority
game, which is a familiar example of voting systems.
In 1960s, U.S. Supreme Court handed down a series of \one person one vote" decisions.
After that, calculations of power indices using real data were carried out and presented
as evidence in the courtroom. For example, the courts in New York State have accepted
the Banzhaf index (also called the Coleman value or Chow parameters) as an appropriate
measure for weighted voting systems. The calculation normally requires the aid of a

  

Source: Allan, Vicki H. - Department of Computer Science, Utah State University

 

Collections: Computer Technologies and Information Sciences