An Explicit Bound on epsilon for Non-Emptiness of the epsilon-Core of an Arbitrary Game with Side Payments
We introduce the concept of a paramaterized collection of games with side payments and determine a bound on epsilon so that all sufficiently large games in such a collection have non-emplty epsilon-cores. A parametrized collection of games is described by (a) the number of approximate player types and the accuracy of this approximation, (b) the size of approximately effective small groups, and (c) the size of the bound on maximal per capita payoffs achievable in coalitions.
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:393.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.