ISER Discussion Paper, Institute of Social and Economic Research, Osaka University 653
This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.
computational complexity NP-completeness simple game core stability Nakamura number