Easy weighted majority games (Q1590151): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving sequential knapsack problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3705340 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3221403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP-completeness of some problems concerning voting games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4138414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5545175 / rank | |||
Normal rank |
Latest revision as of 11:21, 3 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Easy weighted majority games |
scientific article |
Statements
Easy weighted majority games (English)
0 references
19 December 2000
0 references
The authors consider a weighted majority game with \(n\) players. Such a game is easy if the calculation of the number of coalitions for which a player is pivotal can be determined in polynomial time \((n)\). The paper identifies 3 types of games which are easy-unbalanced, generalized unbalanced, and sequential. In each type, a special structure to the voting weights makes the game easy. For instance, in the sequential type, each weight is exactly divided by the next smaller weight. The question whether these 3 types exhaust the class of easy games is left open.
0 references
weighted majority
0 references
voting game
0 references
easy-unbalanced sequential
0 references
generalized unbalanced
0 references