research
The Core Can Be Accessed in a Bounded Number of Steps
- Publication date
- Publisher
Abstract
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.