On the Complexity of the Decisive Problem in Simple and Weighted Games
From MaRDI portal
Publication:2840677
DOI10.1016/j.endm.2011.05.005zbMath1268.91064arXiv1303.7122MaRDI QIDQ2840677
Andreas Polyméris, Fabián Riquelme
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.7122
05C90: Applications of graph theory
91A12: Cooperative games
05C65: Hypergraphs
91B12: Voting theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Forms of representation for simple games: sizes, conversions and equivalences, Counting inequivalent monotone Boolean functions., Cooperation through social influence
Cites Work
- Unnamed Item
- Unnamed Item
- Stability of two player game structures
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
- A linear time algorithm for recognizing regular Boolean functions
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Conjuncturally Stable Coalition Structures