Abstract
In Peleg's investigation of the representation of a simple game by a social choice function, it is shown that a special kind of proper symmetric simple game has its representation by employing the elimination procedure. In this paper, we consider a representation of a characteristic function game and explore general conditions under which the elimination procedure works effectively.
Similar content being viewed by others
References
Aumann, R.J., andB. Peleg: von Neumann-Morgenstern Solutions to Cooperative Games without Side Payments. Bull. of the Amer. Math. Soc.66, 1960, 173–179.
Bloomfield, S.: Social Choice Interpretation of the von Neumann-Morgenstern Game. Econometrica44, 1976, 105–113.
Ishikawa, S., andK. Nakamura: On the Existence of the Core of a Characteristic Function Game with Ordinal Preferences. To appear in Journal of the Operations Research Society of Japan, 1979.
Nakamura, K.: The Vetoers in a Simple Game with Ordinal Preferences. Int. J. of Game Theory8, 1979, 55–61.
Peleg, B.: The Independence of Game Theory of Utility Theory. Bull. of the Amer. Math. Soc.72, 1966, 995–999.
—: Consistent Voting Systems. Econometrica46, 1978a, 153–162.
—: Representation of Simple Games by Social Choice Functions. Int. J. of Game Theory7, 1978b, 81–94.
Polishchuck, I.: Monotonicity and Uniqueness of Consistent Voting Systems. Center for Research in Mathematical Economics and Game Theory, R.M. 32, The Hebrew University, 1978.
Author information
Authors and Affiliations
Additional information
ProfessorKenjiro Nakamura died on October 27, 1979 at the age of 32.
Rights and permissions
About this article
Cite this article
Ishikawa, S., Nakamura, K. Representation of characteristic function games by social choice functions. Int J Game Theory 9, 191–199 (1980). https://doi.org/10.1007/BF01771425
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01771425