Stopping games and Ramsey theorem

Eran Schmaya, Eilon Solan () and Nicolas Vieille ()
Additional contact information
Eran Schmaya: 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 epsilon-equilibrium, for every epsilon>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; Jeux d'arrêt; Théorème de Ramsey (search for similar items in EconPapers)
Date: 2002
Note: View the original document on HAL open archive server: https://hal.science/hal-00242997v1
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://hal.science/hal-00242997v1/document (application/pdf)

Related works:
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-00242997

Access Statistics for this paper

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