An Application of Ramsey Theorem to Stopping Games - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Rapport Année : 2001

An Application of Ramsey Theorem to Stopping Games

Résumé

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.

Domaines

Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-00595481 , version 1

Citer

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

Collections

HEC CNRS LARA
46 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More