Stability of the Core Mapping in Games with a Countable Set of Players

Benyamin Shitovitz and Ezra Einy
Additional contact information
Benyamin Shitovitz: Department of Economics, University of Haifa, Haifa, Israel
Ezra Einy: Department of Economics, Ben-Gurion University of the Negev, P.O. Box 653, Beer-Sheva 84105, Israel

International Journal of Game Theory, 1997, vol. 26, issue 1, 45-50

Abstract: Greenberg (1990) and Ray (1989) showed that in coalitional games with a finite set of players the core consists of those and only those payoffs that cannot be dominated using payoffs in the core of a subgame. We extend the definition of the dominance relation to coalitional games with an infinite set of players and show that this result may not hold in games with a countable set of players (even in convex games). But if a coalitional game with a countable set of players satisfies a mild continuity property, its core consists of those and only those payoff vectors which cannot be dominated using payoffs in the core of a subgame.

Date: 1998-05-19
Note: Received January 1995 Revised version July 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:26:y:1997:i:1:p:45-50

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().