, Eran SHMAYA
() and Eilon SOLAN
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.
13 pages, July 24, 2001
Full text files
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.