On the complexity of problems on simple games
From MaRDI portal
Publication:5388151
DOI10.1051/ro/2011115zbMath1235.68082OpenAlexW2050727325MaRDI QIDQ5388151
Xavier Molinero, Martin Olsen, Maria J. Serna, Josep Freixas
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
Related Items (9)
On the complexity of exchanging ⋮ Influence decision models: from cooperative game theory to social network analysis ⋮ Cooperation through social influence ⋮ On Dedekind's problem for complete simple games ⋮ Multidimension: a dimensionality extension of simple games ⋮ On the generalized dimension and codimension of simple games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Social disruption games in signed networks ⋮ Simple games versus weighted voting games: bounding the critical threshold value
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NP-completeness of some problems concerning voting games
- Simple games and weighted games: A theoretical and computational viewpoint
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Complete simple games
- Simple games and magic squares
- On the geometric separability of Boolean functions
- On the computational complexity of weighted voting games
- Weighted voting, abstention, and multiple levels of approval
- On the dimension of simple monotonic games
- On the Complexity of Cooperative Solution Concepts
- NP-completeness for calculating power indices of weighted majority games
- Decision tree approximations of Boolean functions
This page was built for publication: On the complexity of problems on simple games
