European Business Schools Librarian's Group

Les Cahiers de Recherche,
HEC Paris

No 746: An Application of Ramsey Theorem to stopping Games

Nicolas VIEILLE , Eran SHMAYA () and Eilon SOLAN ()
Additional contact information
Eran SHMAYA: The School of Mathematical Sciences, Tel Aviv University
Eilon SOLAN: Kellog Graduate School of Management, Northwestern University

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.

Keywords: non zero-sum stopping games; Ramsey theorem; equilibrium payoff

JEL-codes: C72; C73

13 pages, July 24, 2001

Full text files

652b2e846c7cf2c3164a39901794652f.pdf PDF-file 

Download statistics

Questions (including download problems) about the papers in this series should be directed to Antoine Haldemann ()
Report other problems with accessing this service to Sune Karlsson ().

This page generated on 2018-02-22 16:52:55.