On the Complexity of the Decisive Problem in Simple and Weighted Games

DOI10.1016/j.endm.2011.05.005zbMath1268.91064arXiv1303.7122OpenAlexW2046053229MaRDI 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

zbMATH Keywords

hypergraphself-dualityquasi-polynomialsimple/weighted game

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cooperative games (91A12) Hypergraphs (05C65) Voting theory (91B12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Cooperation through social influence, Forms of representation for simple games: sizes, conversions and equivalences, Counting inequivalent monotone Boolean functions.

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