Forms of representation for simple games: sizes, conversions and equivalences

DOI10.1016/J.MATHSOCSCI.2015.04.008zbMATH Open1331.91023OpenAlexW2012023964MaRDI QIDQ898760FDOQ898760

Authors: Xavier Molinero, Fabián Riquelme, Maria 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

Recommendations

• On the complexity of problems on simple games
• Dimension and codimension of simple games
• On the characterization of weighted simple games
• Simple games versus weighted voting games
• Different ways to represent weighted majority games

Mathematics Subject Classification ID

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)

Cites Work

• On threshold BDDs and the optimal variable ordering problem
• Title not available (Why is that?)
• Graph-Based Algorithms for Boolean Function Manipulation
• Computing power indices in weighted multiple majority games.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On defining sets of vertices of the hypercube by linear inequalities
• Complete simple games
• Threshold graphs and related topics
• On the dimension of simple monotonic games
• Cooperation through social influence
• On the complexity of exchanging
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branching Programs and Binary Decision Diagrams
• Title not available (Why is that?)
• On the complexity of problems on simple games
• A logical calculus of the ideas immanent in nervous activity
• Weighted voting, multicameral representation, and power
• A characterization, existence proof and dimension bounds for the kernel of a game
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Totally Balanced Games and Games of Flow
• Lattice Theoretic Properties of Frontal Switching Functions
• A class of simple games
• Computational Aspects of Cooperative Game Theory
• On the complexity of branching programs and decision trees for clique functions
• On the existence of a minimum integer representation for weighted voting systems
• On generating all maximal independent sets
• A new index of power for simple n-person games
• A CLASS OF MAJORITY GAMES
• Weighted games without a unique minimal representation in integers
• Binary Decision Diagrams
• A minimum dimensional class of simple games
• On shortest path games
• On the use of binary decision diagrams for solving problems on simple games
• On Dedekind's problem for complete simple games
• Comparing power indices
• Improving the variable ordering of OBDDs is NP-complete
• Directed and weighted majority games
• Title not available (Why is that?)
• Computational aspects of monotone dualization: a brief survey
• Cost allocation in shortest path games
• On the computational complexity of weighted voting games
• Power Indices in Spanning Connectivity Games
• Manipulating the quota in weighted voting games
• Sharing rewards in cooperative connectivity games
• Theory of majority decision elements
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• Threshold hypergraphs
• On minimum integer representations of weighted games
• On the complexity of the decisive problem in simple and weighted games
• 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?)
• A Characterization of Weighted Voting
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
• Title not available (Why is that?)
• An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
• Disjoint Products and Efficient Computation of Reliability
• Title not available (Why is that?)
• Size of ordered binary decision diagrams representing threshold functions
• Title not available (Why is that?)
• Regular simple games
• A linear time algorithm for recognizing regular Boolean functions
• Modified branching programs and their computational power
• Star-shapedness of the kernel for homogeneous games
• Title not available (Why is that?)
• Decisions by players of comparable strength
• Prisoners' Dilemama and Professional Sports Drafts
• Evaluation, Strength, and Relevance of Variables of Boolean Functions
• Preferences, Summation, and Social Welfare Functions
• Stability of two player game structures

Cited In (11)

• On the complexity of exchanging
• Title not available (Why is that?)
• Enumeration of simple games with two equivalence classes of players
• Coalitional desirability and the equal division value
• Influence decision models: from cooperative game theory to social network analysis
• Social disruption games in signed networks
• On the generalized dimension and codimension of simple games
• Dynamic programming for computing power indices for weighted voting games with precoalitions
• Multidimension: a dimensionality extension of simple games
• On the use of binary decision diagrams for solving problems on simple games
• Dimension and codimension of simple games

Uses Software

• azove
• JBool
• PATRICIA

This page was built for publication: Forms of representation for simple games: sizes, conversions and equivalences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898760)