On minimum integer representations of weighted games
From MaRDI portal
Publication:2446687
Abstract: We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if the exist at all, are linked with some solution concepts in game theory. Closing existing gaps in the literature, we prove that each weighted game with two types of voters admits a (unique) minimum integer representation, and give new examples for more than two types of voters without a minimum integer representation. We characterize the possible weights in minimum integer representations and give examples for types of voters without a minimum integer representation preserving types, i.e., where we additionally require that the weights are equal within equivalence classes of voters.
Recommendations
Cites work
- A class of simple games
- A linear algorithm for integer programming in the plane
- A minimum dimensional class of simple games
- Algebraic Techniques for Constructing Minimal Weight Threshold Functions
- Complete simple games
- Complete voting systems with two classes of voters: weightedness and counting
- Computing the Continuous Discretely
- Directed and weighted majority games
- Enumeration of Threshold Functions of Eight Variables
- Factoring polynomials with rational coefficients
- Fast integer programming in fixed dimension
- scientific article; zbMATH DE number 49085 (Why is no real title available?)
- scientific article; zbMATH DE number 1357433 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Majority Decision Functions of up to Six Variables
- Mathematical Properties of the Banzhaf Power Index
- On Dedekind's problem for complete simple games
- On minimum sum representations for weighted voting games
- On the Enumeration of Majority Games
- On the existence of a minimum integer representation for weighted voting systems
- On the minimal representation of homogeneous games
- On Weights of Constant-Sum Majority Games
- Weighted games without a unique minimal representation in integers
Cited in
(21)- On the minimal representation of homogeneous games
- Representation-compatible power indices
- On the characterization of weighted simple games
- Proper strong-Fibonacci games
- On minimum sum representations for weighted voting games
- A note on the growth of the dimension in complete simple games
- Power illusion in coalitional bargaining: an experimental analysis
- On Dedekind's problem for complete simple games
- Bounds for the Nakamura number
- On weights and quotas for weighted majority voting games
- Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds
- Weighted games without a unique minimal representation in integers
- On -roughly weighted games
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
- Minimal Representations for Majority Games
- Enumeration of simple games with two equivalence classes of players
- All power structures are achievable in basic weighted games
- ILP and CP models for normalized integer weighted voting game design problem
- TheOrdinals
- Heuristic and exact solutions to the inverse power index problem for small voting bodies
- Forms of representation for simple games: sizes, conversions and equivalences
This page was built for publication: On minimum integer representations of weighted games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446687)