Optimal Stopping Games and Nash Equilibrium
Author:
- G. PeskirGPG. Peskir
- 1 January 2009
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Theory of Probability & Its Applications
- Vol. 53 (3) , 558-571
Abstract
We show that the value function of the optimal stopping game for a right-continuous strong Markov process can be identified via equality between the smallest superharmonic and the largest subharmonic function lying between the gain functions (semiharmonic characterization) if and only if the Nash equilibrium holds (i.e., there exists a saddle point of optimal stopping times). When specialized to optimal stopping problems it is seen that the former identification reduces to the classic characterization of the value function in terms of superharmonic or subharmonic functions. The equivalence itself shows that finding the value function by “pulling a rope” between “two obstacles” is the same as establishing a Nash equilibrium. Further properties of the value function and the optimal stopping times are exhibited in the proof.Keywords
This publication has 24 references indexed in Scilit:
- Optimal Stopping Games for Markov ProcessesSIAM Journal on Control and Optimization, 2008
- The McKean stochastic game driven by a spectrally negative Lévy processElectronic Journal of Probability, 2008
- On the value of optimal stopping gamesThe Annals of Applied Probability, 2006
- Properties of game optionsMathematical Methods of Operations Research, 2005
- Bounded Variation Singular Stochastic Control and Dynkin GameSIAM Journal on Control and Optimization, 2005
- Further calculations for Israeli optionsStochastics and Stochastic Reports, 2004
- Nonzero-sum stochastic differential games with stopping times and free boundary problemsTransactions of the American Mathematical Society, 1977
- Construction of the Cost and Optimal Policies in a Game Problem of Stopping a Markov ProcessTheory of Probability & Its Applications, 1976
- Nonlinear variational inequalities and differential games with stopping timesJournal of Functional Analysis, 1974
- The Optimal Stopping Rule for a Two-Person Markov Chain with Opposing InterestsTheory of Probability & Its Applications, 1969