Skip to Main content Skip to Navigation
Reports

An Application of Ramsey Theorem to Stopping Games

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.
Complete list of metadatas

https://hal-hec.archives-ouvertes.fr/hal-00595481
Contributor : Antoine Haldemann <>
Submitted on : Tuesday, May 24, 2011 - 7:29:57 PM
Last modification on : Monday, January 29, 2018 - 5:22:54 PM

Identifiers

  • HAL Id : hal-00595481, version 1

Collections

Citation

Eran Shmaya, Eilon Solan, Nicolas Vieille. An Application of Ramsey Theorem to Stopping Games. 2001. ⟨hal-00595481⟩

Share

Metrics

Record views

155