Computing power indices in weighted multiple majority games. (Q1402487)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing power indices in weighted multiple majority games. |
scientific article; zbMATH DE number 1972129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing power indices in weighted multiple majority games. |
scientific article; zbMATH DE number 1972129 |
Statements
Computing power indices in weighted multiple majority games. (English)
0 references
28 August 2003
0 references
The authors present a method of computing the Banzhaf index and the Shapley-Shubik index efficiently by using generating functions for weighted multiple majority games and analyze its temporal complexity. See also the articles by \textit{S. J. Brams} and \textit{Affuso} [Theory and Decision 7, 29--56 (1976)] and \textit{A. Tannenbaum} [The Mathematica Journal 7, 58--63 (1997)] in this connection. The authors also apply the algorithms obtained to compute both the Banzhaf index and the Shapley-Shubik index under the two decision rules adopted in the Nice European Union Summit.
0 references
Shapley-Shubik power index
0 references
Banzhaf power index
0 references
generating function
0 references
0.9600207
0 references
0.94574124
0 references
0.9267216
0 references
0.9234871
0 references
0.91183937
0 references
0.9109399
0 references
0.90519655
0 references
0.9038271
0 references