Skip to main content
Article thumbnail
Location of Repository

The Core Can Be Accessed in a Bounded Number of Steps

By László Á. Kóczy


This paper strengthens the result of Sengupta and Sengupta (1996). We show that for the class of games with nonempty cores the core can be reached in a bounded number of proposals and counterproposals. Our result is more general than this: the boundedness holds for any two imputations with an indirect dominance relation between them.dynamic cooperative game, indirect dominance, core.

OAI identifier:

Suggested articles


  1. (1992). The core and balancedness. In: Aumann RJ, Hart S (eds.) Handbook of game theory, North Holland, Amsterdam pp. 355–395 P´ eter R

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