On -roughly weighted games
From MaRDI portal
Publication:403979
DOI10.1007/S00182-013-0402-XzbMATH Open1304.91021arXiv1112.2861OpenAlexW2069561241MaRDI QIDQ403979FDOQ403979
Publication date: 29 August 2014
Published in: International Journal of Game Theory (Search for Journal in Brave)
Abstract: Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class consists of all simple games permitting a weighted representation such that each winning coalition has a weight of at least 1 and each losing coalition a weight of at most . For a given game the minimal possible value of is called its critical threshold value. We continue the work on the critical threshold value, initiated by Gvozdeva et al., and contribute some new results on the possible values for a given number of voters as well as some general bounds for restricted subclasses of games. A strong relation beween this concept and the cost of stability, i.e. the minimum amount of external payment to ensure stability in a coalitional game, is uncovered.
Full work available at URL: https://arxiv.org/abs/1112.2861
hierarchysimple gameBoolean functionsvoting theorycomplete simple gameroughly weighted gameweighted game
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analyzing the computational impact of MIQCP solver components
- Extending a CIP Framework to Solve MIQCPs
- Complete simple games
- Dimension of complete simple games with minimum
- Weighted voting, abstention, and multiple levels of approval
- On the dimension of simple monotonic games
- Weighted voting, multicameral representation, and power
- Totally Balanced Games and Games of Flow
- A class of simple games
- Ternary voting games
- On minimum sum representations for weighted voting games
- On the inverse power index problem
- Weighted games without a unique minimal representation in integers
- On Some Network Flow Games
- Weighted and roughly weighted simple games
- The distribution of power in the European constitution
- The Least-Core of Threshold Network Flow Games
- The Cost of Stability in Network Flow Games
- The Cost of Stability in Coalitional Games
- Improved approximation of linear threshold functions
- Effectivity functions and simple games
- A power analysis of linear games with consensus
- Three hierarchies of simple games parameterized by ``resource parameters
- Linear programming. Foundations and extensions.
- The Hadamard Maximum Determinant Problem
Cited In (11)
- Simple games versus weighted voting games: bounding the critical threshold value
- A parameterization for a class of complete games with abstention
- Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds
- The inverse problem for power distributions in committees
- The cost of getting local monotonicity
- Trading transforms of non-weighted simple games and integer weights of weighted simple games
- \(\alpha\)-decisiveness in simple games
- On coset weighted potential game
- A note on weighted multi-glove games
- Bounds for the Nakamura number
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Simple games and weighted games: A theoretical and computational viewpoint π π
- On weight function methods in chooser-picker games π π
- Weighted and roughly weighted simple games π π
- On the characterization of weighted simple games π π
- On \(\alpha\)-constant-sum games π π
- On minimum integer representations of weighted games π π
- On non-atomic weighted majority games π π
- On the complexity of the decisive problem in simple and weighted games π π
- Weighted Badly Approximable Vectors and Games π π
This page was built for publication: On \(\alpha\)-roughly weighted games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403979)