An Application of Ramsey Theorem to Stopping Games - Archive ouverte HAL Access content directly
Reports Year :

An Application of Ramsey Theorem to Stopping Games

(1, 2) , (2) , (3)
1
2
3

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.
Not file

Dates and versions

hal-00595481 , version 1 (24-05-2011)

Identifiers

  • HAL Id : hal-00595481 , version 1

Cite

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

Collections

HEC CNRS LARA
46 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More