The Core Can Be Accessed in a Bounded Number of Steps
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.
|Date of creation:||04 Feb 2002|
|Date of revision:||04 Feb 2002|
|Note:||Type of Document - PDF; prepared on IBM PC - PC-TEX; to print on PostScript; pages: 8 ; figures: 1 - included. Work in progress, comments welcome!|
|Contact details of provider:|| Web page: http://18.104.22.168|
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0202001. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If references are entirely missing, you can add them using this form.