An Application of Ramsey Theorem to stopping Games

Nicolas Vieille (), Eran Shmaya () and Eilon Solan ()
Additional contact information
Eran Shmaya: The School of Mathematical Sciences, Tel Aviv University

No 746, HEC Research Papers Series from HEC Paris

Abstract: We prove that every two-player non zero-sum deterministic stopping game with uniformly bounded payoffs admits an e-equilibrium, for every e>0. The proof uses Ramsey Theorem that states that for every coloring of a complete infinite graph by finitely many colors there is a complete infinite subgraph which is monochromatic.

Keywords: non zero-sum stopping games; Ramsey theorem; equilibrium payoff (search for similar items in EconPapers)
JEL-codes: C72 C73 (search for similar items in EconPapers)
Pages: 13 pages
Date: 2001-07-24
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.hec.fr/var/fre/storage/original/applica ... 164a39901794652f.pdf (application/pdf)

Related works:
Journal Article: An application of Ramsey theorem to stopping games (2003)
Working Paper: An application of Ramsey theorem to stopping games (2003)
Working Paper: An Application of Ramsey Theorem to Stopping Games (2001)
Working Paper: An Application of Ramsey Theorem to Stopping Games (2001)
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:ebg:heccah:0746

Access Statistics for this paper

More papers in HEC Research Papers Series from HEC Paris HEC Paris, 78351 Jouy-en-Josas cedex, France. Contact information at EDIRC.
Bibliographic data for series maintained by Antoine Haldemann ().