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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: 8 pages Date of creation: 04 Feb 2002 Date of revision:
04 Feb 2002 Handle: RePEc:wpa:wuwpga:0202001
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://129.3.20.41
For technical questions regarding this item, or to correct its listing, contact: (EconWPA).
Find related papers by JEL classification: C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
This paper has been announced in the following NEP Reports: