Three Theorems on Non-Emptiness of Approximate Cores: Part 1. Game Theoretic Results
We introduce the framework of parametrized collections of games and provide three nonemptiness of approximate core theorems for arbitrary games without (and with) sidepayments. The framework and theorems are sufficiently general to encompass results in the literature on nonemptiness of approximate cores of games derived from pregames. The theorems are based on a new notion of strongly balanced profiles and approximately strongly balanced profiles.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1997|
|Date of revision:|
|Contact details of provider:|| Postal: 08193, Bellaterra, Barcelona|
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Web page: http://pareto.uab.cat
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:aub:autbar:390.97. 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: (Xavier Vila)
If references are entirely missing, you can add them using this form.