Forms of representation for simple games: sizes, conversions and equivalences
From MaRDI portal
Publication:898760
DOI10.1016/j.mathsocsci.2015.04.008zbMath1331.91023OpenAlexW2012023964MaRDI QIDQ898760
Xavier Molinero, Fabián Riquelme, Maria J. Serna
Publication date: 18 December 2015
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/77521
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Voting theory (91B12)
Related Items
Influence decision models: from cooperative game theory to social network analysis ⋮ Coalitional desirability and the equal division value ⋮ Dynamic programming for computing power indices for weighted voting games with precoalitions ⋮ Multidimension: a dimensionality extension of simple games ⋮ On the generalized dimension and codimension of simple games ⋮ Social disruption games in signed networks ⋮ Dimension and codimension of simple games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of exchanging
- Manipulating the quota in weighted voting games
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- A class of simple games
- A minimum dimensional class of simple games
- Computational aspects of monotone dualization: a brief survey
- Stability of two player game structures
- On threshold BDDs and the optimal variable ordering problem
- On the existence of a minimum integer representation for weighted voting systems
- Threshold hypergraphs
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- On generating all maximal independent sets
- Regular simple games
- Modified branching programs and their computational power
- Weighted voting, multicameral representation, and power
- On defining sets of vertices of the hypercube by linear inequalities
- A new index of power for simple n-person games
- Complete simple games
- Star-shapedness of the kernel for homogeneous games
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
- Size of ordered binary decision diagrams representing threshold functions
- Cost allocation in shortest path games
- On shortest path games
- Computing power indices in weighted multiple majority games.
- Threshold graphs and related topics
- On the use of binary decision diagrams for solving problems on simple games
- On the computational complexity of weighted voting games
- On Dedekind's problem for complete simple games
- On minimum integer representations of weighted games
- A characterization, existence proof and dimension bounds for the kernel of a game
- Theory of majority decision elements
- On the dimension of simple monotonic games
- Cooperation through social influence
- On the Complexity of the Decisive Problem in Simple and Weighted Games
- COMPARING POWER INDICES
- Computational Aspects of Cooperative Game Theory
- A linear time algorithm for recognizing regular Boolean functions
- A CLASS OF MAJORITY GAMES
- Weighted games without a unique minimal representation in integers
- Power Indices in Spanning Connectivity Games
- Decisions by players of comparable strength
- Graph-Based Algorithms for Boolean Function Manipulation
- On the complexity of branching programs and decision trees for clique functions
- Disjoint Products and Efficient Computation of Reliability
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Totally Balanced Games and Games of Flow
- A Characterization of Weighted Voting
- Binary Decision Diagrams
- Prisoners' Dilemama and Professional Sports Drafts
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
- Improving the variable ordering of OBDDs is NP-complete
- Branching Programs and Binary Decision Diagrams
- Evaluation, Strength, and Relevance of Variables of Boolean Functions
- Directed and weighted majority games
- Sharing Rewards in Cooperative Connectivity Games
- On the complexity of problems on simple games
- Preferences, Summation, and Social Welfare Functions
- Lattice Theoretic Properties of Frontal Switching Functions
- A logical calculus of the ideas immanent in nervous activity
