An Application of Ramsey Theorem to stopping Games

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.

MoreLess

Year of publication:	2001-07-24
Authors:	VIEILLE, Nicolas ; SHMAYA, Eran ; SOLAN, Eilon
Institutions:	HEC Paris (École des Hautes Études Commerciales)
Subject:	non zero-sum stopping games \| Ramsey theorem \| equilibrium payoff

More details

Extent:	application/pdf
Series:	Les Cahiers de Recherche.
Type of publication:	Book / Working Paper
Language:	English
Notes:	The text is part of a series Les Cahiers de Recherche - Groupe HEC Number 746 13 pages
Classification:	C72 - Noncooperative Games ; C73 - Stochastic and Dynamic Games
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005011680