An application of Ramsey theorem to stopping games

Eran Shmaya, Eilon Solan*, Nicolas Vieille

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


We prove that every two-player nonzero-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.

Original languageEnglish (US)
Pages (from-to)300-306
Number of pages7
JournalGames and Economic Behavior
Issue number2
StatePublished - Feb 2003


  • Equilibrium payoff
  • Nonzero-sum stopping games
  • Ramsey Theorem

ASJC Scopus subject areas

  • Finance
  • Economics and Econometrics


Dive into the research topics of 'An application of Ramsey theorem to stopping games'. Together they form a unique fingerprint.

Cite this