An Explicit Bound on E For Nonemptimess of E-Cores of Games
We consider parameterized collections of games without side payments and determine a bound on E so that all sufficiently large games in the collection have non-empty E-cores. Our result makes explicit the relationship between the required size of E for non-emptiness of the E-core, the parameters describing the collection of games, and the size of the total player set. Given the parameters describing the collection, the larger the game, the smaller the E that can be chosen
|Date of creation:||1999|
|Date of revision:|
|Contact details of provider:|| Postal: CV4 7AL COVENTRY|
Phone: +44 (0) 2476 523202
Fax: +44 (0) 2476 523032
Web page: http://www2.warwick.ac.uk/fac/soc/economics/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kaneko, Mamoru & Wooders, Myrna Holtz, 1982.
"Cores of partitioning games,"
Mathematical Social Sciences,
Elsevier, vol. 3(4), pages 313-327, December.
- Kaneko, Mamoru & Wooders, Myrna Holtz, 1996. "The Nonemptiness of the f-Core of a Game without Side Payments," International Journal of Game Theory, Springer;Game Theory Society, vol. 25(2), pages 245-58.
- Herbert E. Scarf, 1965. "The Core of an N Person Game," Cowles Foundation Discussion Papers 182R, Cowles Foundation for Research in Economics, Yale University.
When requesting a correction, please mention this item's handle: RePEc:wrk:warwec:537. 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: (Robyn Till)
If references are entirely missing, you can add them using this form.