Complete simple games
From MaRDI portal
Publication:1278570
DOI10.1016/0165-4896(96)00815-3zbMath0920.90143OpenAlexW2062270858MaRDI QIDQ1278570
Francesc Carreras, Josep Freixas
Publication date: 31 August 1999
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-4896(96)00815-3
Related Items (53)
On the complexity of exchanging ⋮ On the inverse power index problem ⋮ The minimum sum representation as an index of voting power ⋮ Achievable hierarchies in voting games with abstention ⋮ Protectionism and blocking power indices ⋮ On Dedekind's problem for complete simple games ⋮ Coalitional desirability and the equal division value ⋮ Representation-compatible power indices ⋮ Hierarchies achievable in simple games ⋮ Automorphisms and blocking in simple games ⋮ Different ways to represent weighted majority games ⋮ On the use of binary decision diagrams for solving problems on simple games ⋮ Growth of dimension in complete simple games ⋮ Complete voting systems with two classes of voters: weightedness and counting ⋮ Bounds for the Nakamura number ⋮ On \(\alpha\)-roughly weighted games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ On ordinal equivalence of power measures given by regular semivalues ⋮ Enumeration of simple games with two equivalence classes of players ⋮ On the ordinal equivalence of the Johnston, Banzhaf and Shapley power indices ⋮ On the manipulability of equitable voting rules ⋮ The influence relation for ternary voting games ⋮ On the characterization of weighted simple games ⋮ Weighted and roughly weighted simple games ⋮ On the enumeration of some inequivalent monotone Boolean functions ⋮ On minimum integer representations of weighted games ⋮ Partnership formation and multinomial values ⋮ Proportional quota weighted voting system hierarchies. II ⋮ Hierarchy of players in swap robust voting games ⋮ A parameterization for a class of complete games with abstention ⋮ On the complexity of problems on simple games ⋮ Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum ⋮ Winning coalitions in plurality voting democracies ⋮ Dimension of complete simple games with minimum ⋮ The influence of the node criticality relation on some measures of component importance ⋮ On ordinal equivalence of the Shapley and Banzhaf values for cooperative games ⋮ On the ordinal equivalence of the Jonhston, Banzhaf and Shapley-Shubik power indices for voting games with abstention ⋮ On minimum sum representations for weighted voting games ⋮ A power analysis of linear games with consensus ⋮ A decisiveness index for simple games ⋮ Proportional quota weighted voting system hierarchies ⋮ On the structure of minimal winning coalitions in simple voting games ⋮ A note on the growth of the dimension in complete simple games ⋮ On the enumeration of bipartite simple games ⋮ The integer nucleolus of directed simple games: a characterization and an algorithm ⋮ Partnership formation and binomial semivalues ⋮ Heuristic and exact solutions to the inverse power index problem for small voting bodies ⋮ On the existence of a minimum integer representation for weighted voting systems ⋮ Simple games and weighted games: A theoretical and computational viewpoint ⋮ SOME OPEN PROBLEMS IN SIMPLE GAMES ⋮ A critical analysis on the notion of power ⋮ On the enumeration of Boolean functions with distinguished variables ⋮ Roughly weighted hierarchical simple games
Cites Work
- The desirability relation of simple games
- Regular simple games
- A characterization, existence proof and dimension bounds for the kernel of a game
- A CLASS OF MAJORITY GAMES
- A Characterization of Weighted Voting
- Threshold Logic Asymptotes
- The Counting Vector of a Simple Game
- Threshold Numbers and Threshold Completions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complete simple games
