Easy weighted majority games
type: Item
instance of: scholarly article
title: Easy weighted majority games
zbMATH Open document ID: 0962.91006
DOI: 10.1016/S0165-4896(99)00050-5
author: Nilotpal Chakravarty
author: Anand Mohan Goel
author: Trilochan Sastry
published in: Mathematical Social Sciences
publication date: 2000-12-19T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1545422
zbMATH Keywords: weighted majority
zbMATH Keywords: voting game
zbMATH Keywords: easy-unbalanced sequential
zbMATH Keywords: generalized unbalanced
MaRDI profile type: Publication
cites work: On the computational power of pushdown automata
cites work: Solving sequential knapsack problems
cites work: Q3705340
cites work: Q3221403
cites work: NP-completeness of some problems concerning voting games
cites work: Q4138414
cites work: Q5545175
description: scientific article; zbMATH DE number 1545422