Optimal stopping under ambiguity
AbstractWe consider optimal stopping problems for ambiguity averse decision makers with multiple priors. In general, backward induction fails. If, however, the class of priors is time-consistent, we establish a generalization of the classical theory of optimal stopping. To this end, we develop first steps of a martingale theory for multiple priors. We define minimax (super)martingales, provide a Doob-Meyer decomposition, and characterize minimax martingales. This allows us to extend the standard backward induction procedure to ambiguous, time-consistent preferences. The value function is the smallest process that is a minimax supermartingale and dominates the payoff process. It is optimal to stop when the current payoff is equal to the value function. Moving on, we study the infinite horizon case. We show that the value process satisfies the same backward recursion (Bellman equation) as in the finite horizon case. The finite horizon solutions converge to the infinite horizon solution. Finally, we characterize completely the set of time-consistent multiple priors in the binomial tree. We solve two classes of examples: the so-called independent and indistinguishable case (the parking problem) and the case of American Options (Cox-Ross-Rubinstein model).
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Bielefeld University, Center for Mathematical Economics in its series Working Papers with number 390.
Length: 37 pages
Date of creation: Mar 2007
Date of revision:
optimal stopping; ambiguity; uncertainty aversion;
Find related papers by JEL classification:
- D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- G11 - Financial Economics - - General Financial Markets - - - Portfolio Choice; Investment Decisions
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-02-07 (All new papers)
- NEP-BEC-2009-02-07 (Business Economics)
- NEP-UPT-2009-02-07 (Utility Models & Prospect Theory)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Gilboa, Itzhak & Schmeidler, David, 1989. "Maxmin expected utility with non-unique prior," Journal of Mathematical Economics, Elsevier, vol. 18(2), pages 141-153, April.
- Alain Chateauneuf & Fabio Macheronni & Massimo Marinacci & Jean-Marc Tallon, 2005.
"Monotone continuous multiple priors,"
UniversitÃ© Paris1 PanthÃ©on-Sorbonne (Post-Print and Working Papers)
- Riedel, Frank, 2004.
"Dynamic coherent risk measures,"
Stochastic Processes and their Applications,
Elsevier, vol. 112(2), pages 185-200, August.
- Larry G. Epstein & Martin Schneider, 2001.
RCER Working Papers
485, University of Rochester - Center for Economic Research (RCER).
- Föllmer, Hans & Kabanov, Jurij M., 1997.
"Optional decomposition and lagrange multipliers,"
SFB 373 Discussion Papers
1997,54, Humboldt University of Berlin, Interdisciplinary Research Project 373: Quantification and Simulation of Economic Processes.
- Eichberger, Jurgen & Kelsey, David, 1996.
"Uncertainty Aversion and Dynamic Consistency,"
International Economic Review,
Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 37(3), pages 625-40, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dr. Frederik Herzberg).
If references are entirely missing, you can add them using this form.