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.
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
Cites work
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 1228791 (Why is no real title available?)
- scientific article; zbMATH DE number 1357433 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A Characterization of Weighted Voting
- A Hadamard matrix of order 428
- A counterexample to Fishburn's conjecture on finite linear qualitative probability
- Additive representability of finite measurement structures
- Complete simple games
- Finite linear qualitative probability
- Intuitive Probability on Finite Sets
- Obstructions to shiftedness
- On Finite Projective Games
- On the existence of extremal cones and comparative probability orderings
- Simple games and magic squares
- Simple games and weighted games: A theoretical and computational viewpoint
- Threshold Logic Asymptotes
- Threshold graphs, shifted complexes, and graphical complexes
Cited in
(21)- scientific article; zbMATH DE number 7533361 (Why is no real title available?)
- 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 -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.
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)
