An explicit bound on epsilon for nonemptiness of Epsilon-cores of games

Abstract

We consider parameterized collections of games without side payments and determine a bound on epsilon so that all suffciently large games in the collection have non-empty epsilon-cores. Our result makes explicit the relationship between the required size of epsilon for non-emptiness of the epsilon-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 epsilon that can be chosen.cooperative games, games without side payments (NTU games), large games, approximate cores, effective small groups, parameterized collections of games.