Weighted and roughly weighted simple games

DOI10.1016/J.MATHSOCSCI.2010.09.001zbMATH Open1208.91040DBLPjournals/mss/GvozdevaS11arXiv0912.5364OpenAlexW3121509361WikidataQ61586231 ScholiaQ61586231MaRDI QIDQ631116FDOQ631116

Authors: Tatiana Gvozdeva, Arkadii Slinko 

Publication date: 22 March 2011

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Abstract: This paper contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern (1944). One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The necessary and sufficient conditions that guarantee weightedness were obtained by Elgot (1961) and refined by Taylor and Zwicker (1992). If a simple game does not have weights, then rough weights may serve as a reasonable substitute (see their use in Taylor and Zwicker, 1992). A simple game is roughly weighted if there exists a system of weights and a threshold such that all coalitions whose combined weight is above the threshold are winning and all coalitions whose combined weight is below the threshold are losing and a tie-breaking is needed to classify the coalitions whose combined weight is exactly the threshold. Not all simple games are roughly weighted, and the class of projective games is a prime example. In this paper we give necessary and sufficient conditions for a simple game to have rough weights. We define two functions f(n) and g(n) that measure the deviation of a simple game from a weighted majority game and roughly weighted majority game, respectively. We formulate known results in terms of lower and upper bounds for these functions and improve those bounds. We also investigate rough weightedness of simle games with a small number of players.

Full work available at URL: https://arxiv.org/abs/0912.5364

Recommendations

• Trading transforms of non-weighted simple games and integer weights of weighted simple games
• On the characterization of weighted simple games
• Simple games and weighted games: A theoretical and computational viewpoint
• Simple games versus weighted voting games: bounding the critical threshold value
• Roughly weighted hierarchical simple games

zbMATH Keywords

simple gameHadamard gamesprojective gamesrough weightstrading transformweighted majority game

Mathematics Subject Classification ID

Cooperative games (91A12) (n)-person games, (n>2) (91A06) Voting theory (91B12)

Cites Work

• Title not available (Why is that?)
• Intuitive Probability on Finite Sets
• Simple games and weighted games: A theoretical and computational viewpoint
• Complete simple games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Hadamard matrix of order 428
• A counterexample to Fishburn's conjecture on finite linear qualitative probability
• Finite linear qualitative probability
• Title not available (Why is that?)
• A Characterization of Weighted Voting
• Obstructions to shiftedness
• Threshold graphs, shifted complexes, and graphical complexes
• Simple games and magic squares
• On the existence of extremal cones and comparative probability orderings
• On Finite Projective Games
• Additive representability of finite measurement structures
• Threshold Logic Asymptotes

Cited In (21)

• Weightedness and structural characterization of hierarchical simple games
• Winning coalitions in plurality voting democracies
• On the characterization of weighted simple games
• Easy weighted majority games
• Bounds for \(| W^ m\cup B^ m| \) for simple games.
• Three hierarchies of simple games parameterized by ``resource parameters
• Dimension of the Lisbon voting rules in the EU council: a challenge and new world record
• On \(\alpha\)-roughly weighted games
• The geometry of voting power: weighted voting and hyper-ellipsoids
• Trading transforms of non-weighted simple games and integer weights of weighted simple games
• Some open problems in simple games
• On weighted balls-into-bins games
• On coset weighted potential game
• Polygonizations of point sets in the plane
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• A note on weighted multi-glove games
• Heights of simple games
• Roughly weighted hierarchical simple games
• Weighted Majority Games Have Asymptotic Value
• Mixing weighted values of non-atomic games.
• Title not available (Why is that?)

This page was built for publication: Weighted and roughly weighted simple games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631116)