Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
From MaRDI portal
Publication:490225
DOI10.1007/S10479-013-1348-XzbMATH Open1308.91020arXiv1310.6113OpenAlexW3105320535MaRDI QIDQ490225FDOQ490225
Authors: Josep Freixas, Sascha Kurz 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Abstract: This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class as well. Second, we focus on the special case of bipartite complete games with minimum, and we compare and rank these games according to the behavior of some efficient power indices of players of type 1 (or of type 2). The main result of this second part establishes all allowable rankings of these games when the Shapley-Shubik power index is used on players of type 1.
Full work available at URL: https://arxiv.org/abs/1310.6113
Recommendations
- On minimum sum representations for weighted voting games
- On minimum integer representations of weighted games
- On the computational complexity of weighted voting games
- Weighted games without a unique minimal representation in integers
- A note on hierarchies in weighted voting games and partitions
- On some combinatorial problems arising in the theory of voting games
- On the enumeration of bipartite simple games
- Minimal winning coalitions in weighted-majority voting games
- Computing the nucleolus of weighted voting games
- An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monotonic solutions of cooperative games
- Complete simple games
- The dimension for the European Union Council under the Nice rules.
- Dimension of complete simple games with minimum
- Title not available (Why is that?)
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
- Ordinal equivalence of power notions in voting games
- On ordinal equivalence of power measures given by regular semivalues
- A characterization, existence proof and dimension bounds for the kernel of a game
- Monotone Boolean functions
- On ordinal equivalence of the Shapley and Banzhaf values for cooperative games
- A class of simple games
- Mathematical Properties of the Banzhaf Power Index
- Title not available (Why is that?)
- An explication of secret sharing schemes
- Title not available (Why is that?)
- On minimum sum representations for weighted voting games
- A CLASS OF MAJORITY GAMES
- Mathematics and Politics
- Weighted games without a unique minimal representation in integers
- Weighted and roughly weighted simple games
- Generating functions for coalitional power indices: an application to the IMF
- On Dedekind's problem for complete simple games
- Directed and weighted majority games
- Voting power in the governance of the international monetary fund
- Characterization of the Banzhaf–Coleman Index
- Complete voting systems with two classes of voters: weightedness and counting
- Hierarchical threshold secret sharing
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Complete games with minimum
- Different ways to represent weighted majority games
- Semivalues as power indices.
- Weightedness and structural characterization of hierarchical simple games
- Majority Decision Functions of up to Six Variables
Cited In (7)
- A parameterization for a class of complete games with abstention
- On the enumeration of bipartite simple games
- Enumeration of simple games with two equivalence classes of players
- On the characterization of weighted simple games
- Minimal power-structures in a weighted organization
- On the enumeration of some inequivalent monotone Boolean functions
- Set-weighted games and their application to the cover problem
This page was built for publication: Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490225)
