Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 26, No. 4, November 2001, pp. 654-678
DOI: 10.1287/moor.26.4.654.10001
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Kovalenkov, A.
Right arrow Articles by Wooders, M. H.
Right arrow Search for Related Content

An Exact Bound on Epsilon for Nonemptiness of Epsilon Cores of Games

Alexander Kovalenkov, Myrna Holtz Wooders

Department of Economics, Gardner Hall, University of North Carolina, Chapel Hill, NC 27599-3305
Department of Economics, University of Warwick, Coventry, CV4 7A1, United Kingdom

We consider collections of games with and without side payments described by certain natural parameters. Given the parameters {pi} describing a collection of games and a lower bound n0 on the number of players, we obtain a bound {pi}0 ({pi}, n0) so that, for any {pi} ≥ {pi}0({pi}, n0), all games in the collection with at least n0 players have nonempty {pi}-cores. Examples are provided in which the bound on {pi} is met. For parameter values ensuring that there are many close substitutes for most players and that relatively small groups of players can realize nearly all gains to collective activities, for games with many players the bound on {pi} is small.

Key Words: Cooperative games; games without side payments (NTU games); clubs; large games; approximate cores; effective small groups; parameterized collections of games; small group effectiveness
History: Received: July 2, 1999; revision received: July 27, 2000;revision received: March 19, 2001;





HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2001 by INFORMS.