An Explicit Bound on E For Nonemptimess of E-Cores of Games

Alexander Kovalenkov () and Myrna Wooders

The Warwick Economics Research Paper Series (TWERPS) from University of Warwick, Department of Economics

Abstract: 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

Pages: 28 pages
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://warwick.ac.uk/fac/soc/economics/research/workingpapers/2008/twerp537.pdf

Related works:
Working Paper: An explicit bound on e for nonemptiness of e-cores of games (1999)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wrk:warwec:537

Access Statistics for this paper

More papers in The Warwick Economics Research Paper Series (TWERPS) from University of Warwick, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Margaret Nash ().