The Core Can Be Accessed in a Bounded Number of Steps

Printer-friendly version
Working paper
László Á. Kóczy
Université catholique de Louvain
This paper strengthens the result of Sengupta and Sengupta (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.
Developed by Paolo Gittoi