Abstract
We provide an exact formula for the Nakamura number of a compound simple game. Also, we investigate the capacity of compound games. In particular, we show that if the components are not weak, then the capacity of the compound game is 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Holzman R (1986) The capacity of a committee. Math Soc Sci 12:139–157
Owen G (1982) Game theory, 2nd edn. Academic Press, New York
Nakamura K (1979) The vetoers in a simple game with ordinal preferences. Int J Game Theory 8:55–61
Peleg B (1984) Game theoretic analysis of voting in committees. Cambridge University Press, Cambridge
Shapley LS (1962) Simple games: An outline of the descriptive theory. Behav Sci 7:59–66
Shapley LS (1964) Solutions of compound simple games. In: Advances in game theory, annals of mathematics studies, Vol. 52, pp 267–305. Dresher M, Shapley LS, Tucker AW (eds) Princeton University Press, Princeton
Author information
Authors and Affiliations
Additional information
I am grateful to R. Holzman for some helpful remarks.
The first version of this paper was written when the author was visiting the Department of Economics, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061.
Rights and permissions
About this article
Cite this article
Peleg, B. Cores and capacities of compound simple games. Soc Choice Welfare 4, 307–316 (1987). https://doi.org/10.1007/BF00286871
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00286871