Two-player nonZero-sum stopping games in discrete time
classification
🧮 math.PR
keywords
discreteeverygamesnonzero-sumstochasticstoppingtimetwo-player
read the original abstract
We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the problem to that of studying properties of \epsilon-equilibria in a simple class of stochastic games with finite state space.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.