pith. sign in

arxiv: math/0610324 · v1 · pith:H6EDQNTQnew · submitted 2006-10-10 · 🧮 math.PR · q-fin.CP

On the value of optimal stopping games

classification 🧮 math.PR q-fin.CP
keywords optimalstoppingbuyertimeundervaluealwaysassumptions
0
0 comments X
read the original abstract

We show, under weaker assumptions than in the previous literature, that a perpetual optimal stopping game always has a value. We also show that there exists an optimal stopping time for the seller, but not necessarily for the buyer. Moreover, conditions are provided under which the existence of an optimal stopping time for the buyer is guaranteed. The results are illustrated explicitly in two examples.

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.