Les Cahiers de Recherche - HEC Paris
Nicolas VIEILLE, Eran SHMAYA
An Application of Ramsey Theorem to stopping Games
() and Eilon SOLAN
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; (follow links to similar papers)
JEL-Codes: C72; C73; (follow links to similar papers)
13 pages, July 24, 2001
Before downloading any of the electronic versions below
you should read our statement on
for viewing Postscript files and the
Acrobat Reader for viewing and printing pdf files.
Full text versions of the paper:
Questions (including download problems) about the papers in this series should be directed to Sandra Dupouy ()
Report other problems with accessing this service to Sune Karlsson ()
or Helena Lundin ().
Design Joakim Ekebom