An exact bound on epsilon for nonemptiness of epsilon cores of games
UNSPECIFIED. (2001) An exact bound on epsilon for nonemptiness of epsilon cores of games. MATHEMATICS OF OPERATIONS RESEARCH, 26 (4). pp. 654-678. ISSN 0364-765XFull text not available from this repository.
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 n(0) on the number of players, we obtain a bound epsilon (0) (pi, n(0)) so that, for any epsilon greater than or equal to epsilon (0) (pi, n(0)), all games in the collection with at least n(0) players have nonempty epsilon -cores. Examples are provided in which the bound on epsilon is met. For parameter values ensuring that there arc 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 epsilon is small.
|Item Type:||Journal Article|
|Subjects:||H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Q Science > QA Mathematics
|Journal or Publication Title:||MATHEMATICS OF OPERATIONS RESEARCH|
|Publisher:||INST OPERATIONS RESEARCH MANAGEMENT SCIENCES|
|Number of Pages:||25|
|Page Range:||pp. 654-678|
Actions (login required)