• Medientyp: E-Artikel
  • Titel: An Exact Bound on Epsilon for Nonemptiness of Epsilon Cores of Games
  • Beteiligte: Kovalenkov, Alexander; Wooders, Myrna Holtz
  • Erschienen: Institute for Operations Research and the Management Sciences (INFORMS), 2001
  • Erschienen in: Mathematics of Operations Research, 26 (2001) 4, Seite 654-678
  • Sprache: Englisch
  • DOI: 10.1287/moor.26.4.654.10001
  • ISSN: 0364-765X; 1526-5471
  • Schlagwörter: Management Science and Operations Research ; Computer Science Applications ; General Mathematics
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: We consider collections of games with and without side payments described by certain natural parameters. Given the parameters π describing a collection of games and a lower bound n0 on the number of players, we obtain a bound ϵ0(π, n0) so that, for any ϵ ≥ ϵ0(π, n0), all games in the collection with at least n0 players have nonempty ϵ-cores. Examples are provided in which the bound on ϵ 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 ϵ is small.