Computational Complexity in the Design of Voting Systems
March 2, 2006
Osaka University Social and Economic Research Discussion Paper No. 653
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, D71working papers series
Date posted: March 29, 2006
© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.
This page was processed by apollo2 in 0.312 seconds