An application of Ramsey theorem to stopping games
Abstract
We prove that every two-player nonzero-sum deterministic stopping game with uniformly bounded payoffs admits an var epsilon-equilibrium, for every var 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.