Posted: 29 Mar 2006
Date Written: March 2, 2006
This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting systems, which is formulated in terms of simple games. We point out that it is an NP-complete problem to decide whether a given simple game is stable, or not.
Keywords: computational complexity, NP-completeness, simple game, core, stability, Nakamura number
JEL Classification: C71, D71
Suggested Citation: Suggested Citation
Takamiya, Koji and Tanaka, Akira, Computational Complexity in the Design of Voting Systems (March 2, 2006). Osaka University Social and Economic Research Discussion Paper No. 653. Available at SSRN: https://ssrn.com/abstract=893667