The Core Can Be Accessed in a Bounded Number of Steps
KUL-CES Econometics Working Paper No. 2002/03/02
8 Pages Posted: 28 Mar 2002
Date Written: March 22, 2002
This paper strengthens the result of Sengupta and Sengupta (GEB,1996). We show that for the class of TU games with non-empty cores the core can be reached via 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.
Keywords: dynamic cooperative game, indirect dominance, core
JEL Classification: C71, C73
Suggested Citation: Suggested Citation