论文信息 - On the Complexity of the Decisive Problem in Simple and Weighted Games

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

Abstract We study the computational complexity of an important property of simple and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness can be decided for simple games in quasi-polynomial time, and for weighted games in polynomial time. The strongness condition poses the main difficulties. Instead, properness reduces the complexity of the problem. Specially if it is amplified by weightiness.

Fabián Riquelme | Andreas Polyméris | Fabián Riquelme | A. Polyméris

[1] Leonid Khachiyan,et al. On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.

[2] William S. Zwicker,et al. Simple games - desirability relations, trading, pseudoweightings , 1999 .

[3] Bruno Simeone,et al. A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function , 1994, Discret. Appl. Math..

[4] M. Angélica Pinninghoff Junemann,et al. Response-Ability and its Complexity , 2002, IC-AI.

[5] Andreas Polyméris,et al. Stability of two player game structures , 2008, Discret. Appl. Math..

[6] Kazuhisa Makino,et al. A linear time algorithm for recognizing regular Boolean functions , 1999, J. Algorithms.

[7] Maria J. Serna,et al. The Complexity of Testing Properties of Simple Games , 2008, ArXiv.

[8] A. Polyméris. Conjuncturally Stable Coalition Structures , 1980 .

[9] Saburo Muroga,et al. Threshold logic and its applications , 1971 .

[10] Bruno Simeone,et al. Polynomial-time algorithms for regular set-covering and threshold synthesis , 1985, Discret. Appl. Math..

[11] Andrzej Proskurowski,et al. Centers of 2–Trees , 1980 .