Location of Repository

Computability of simple games: A characterization and application to the core

By Masahiro Kumabe and H. Reiju Mihara

Abstract

It was shown earlier that the class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing that the above inclusions are strict. It also extends Nakamura’s theorem about the nonemptyness of the core and shows that computable games have a finite Nakamura number, implying that the number of alternatives that the players can deal with rationally is restricted.

Topics: D90 - General, D71 - Social Choice; Clubs; Committees; Associations, C71 - Cooperative Games, C69 - Other
Year: 2007
DOI identifier: 10.1016/j.jmateco.2007.05.012
OAI identifier: oai:mpra.ub.uni-muenchen.de:3296

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.