Optimal Stopping With a Total Reward Criterion and Infinite Horizon

Jan Palczewski*

My talk will be concerned with undiscounted infinite horizon optimal stopping problems for Markov processes. Of particular interest will be ergodic properties of a process which guarantee the existence of optimal stopping times. The sufficiency of the uniform geometric ergodicity has been known for years. There were several attempts to relax this condition. I will present new results and discuss their relation to the extant literature.

Mathematics Subject Classification: 93E20 60J25

Keywords: optimal stopping; Markov process; ergodicity; infinite horizon; undiscounted criterion

Minisymposion: Stochastic Models, Control and Applications