An Application of Ramsey Theorem to Stopping Games

Eran Shmaya, Eilon Solan () and Nicolas Vieille ()
Additional contact information
Eran Shmaya: Kellogg [Northwestern] - Kellogg School of Management [Northwestern University, Evanston] - Northwestern University [Evanston], TAU - School of Mathematical Sciences [Tel Aviv] - TAU - Raymond and Beverly Sackler Faculty of Exact Sciences [Tel Aviv] - TAU - Tel Aviv University

Working Papers from HAL

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)
Date: 2001-07-24
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Published in 2001

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

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:hal:wpaper:hal-00595481

Access Statistics for this paper

More papers in Working Papers from HAL
Bibliographic data for series maintained by CCSD ().