On the complexity of problems on simple games
From MaRDI portal
Publication:5388151
DOI10.1051/RO/2011115zbMATH Open1235.68082OpenAlexW2050727325MaRDI QIDQ5388151FDOQ5388151
Authors: Xavier Molinero, Martin Olsen, Josep Freixas, Maria Serna 
Publication date: 18 April 2012
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222510
Recommendations
- Some open problems in simple games
- On Dedekind's problem for complete simple games
- Equilibria problems on games: complexity versus succinctness
- On Complexity of Ehrenfeucht-Fraïssé Games
- On complexity of Ehrenfeucht-Fraïssé games
- On the complexity of succinct zero-sum games
- On the complexity of the decisive problem in simple and weighted games
- Mathematical Foundations of Computer Science 2005
- Computability of simple games: A characterization and application to the core
- The complexity of stochastic games
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple games and weighted games: A theoretical and computational viewpoint
- Complete simple games
- Weighted voting, abstention, and multiple levels of approval
- On the dimension of simple monotonic games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision tree approximations of Boolean functions
- On the Complexity of Cooperative Solution Concepts
- On the computational complexity of weighted voting games
- NP-completeness for calculating power indices of weighted majority games
- NP-completeness of some problems concerning voting games
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Simple games and magic squares
- Title not available (Why is that?)
- On the geometric separability of Boolean functions
Cited In (29)
- Title not available (Why is that?)
- Simple games versus weighted voting games: bounding the critical threshold value
- On the complexity of exchanging
- The fundamental theorem of voting schemes
- Computability of simple games: a complete investigation of the sixty-four possibilities
- NP-completeness of some problems concerning voting games
- The complexity of recursion theoretic games
- Automata, Languages and Programming
- Nonanonymity and sensitivity of computable simple games
- Domino Games and Complexity
- Influence decision models: from cooperative game theory to social network analysis
- Social disruption games in signed networks
- On the dimension of simple monotonic games
- On the generalized dimension and codimension of simple games
- Cooperation through social influence
- On the structure of minimal winning coalitions in simple voting games
- Lexicographic composition of simple games
- Expository notes on computability and complexity in (arithmetical) games
- Title not available (Why is that?)
- Some Advances in the Theory of Voting Systems Based on Experimental Algorithms
- On the Complexity of n-Player Hackenbush
- Simple complexity from imitation games
- Multidimension: a dimensionality extension of simple games
- Complexity of path discovery game problems
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES
- Games with winning conditions of high Borel complexity
- Forms of representation for simple games: sizes, conversions and equivalences
- On Dedekind's problem for complete simple games
- The Game of n-Player Shove and Its Complexity
This page was built for publication: On the complexity of problems on simple games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388151)
