|
|||||
|
|
An application of Ramsey theorem to stopping games |
|
| Authors: | Eran Shmaya Eilon Solan Nicolas Vieille |
| Institution: | a The School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel;b MEDS/Kellogg School of Management, Northwestern University, 2001 Sheridan Road, Evanston, IL 60208, USA;c Département Finance et Economie, HEC, 1, rue de la Libération, 78 351, Jouy-en-Josas, France |
| Abstract: | We prove that every two-player nonzero-sum deterministic stopping game with uniformly bounded payoffs admits an -equilibrium, for every >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: | Nonzero-sum stopping games Ramsey Theorem Equilibrium payoff |
| 本文献已被 ScienceDirect 等数据库收录！ | |