Computing power indices in weighted multiple majority games. (Q1402487): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:13, 5 March 2024

scientific article
Language Label Description Also known as
English
Computing power indices in weighted multiple majority games.
scientific article

    Statements

    Computing power indices in weighted multiple majority games. (English)
    0 references
    0 references
    0 references
    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
    0 references
    Shapley-Shubik power index
    0 references
    Banzhaf power index
    0 references
    generating function
    0 references