Robust best choice problem

被引:2
|
作者
Obradovic, Lazar [1 ,2 ]
机构
[1] Bielefeld Univ, Ctr Math Econ, Bielefeld, Germany
[2] Univ Montenegro, Fac Sci & Math, Podgorica, Montenegro
关键词
Optimal stopping; Best choice problem; Secretary problem; Model uncertainty; Ambiguity aversion; FULL-INFORMATION;
D O I
10.1007/s00186-020-00719-5
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a robust version of thefull information best choiceproblem: there is model uncertainty, represented by a set of priors, about the measure driving the observed process. We propose a general construction of the set of priors that we use to solve the problem in the setting of Riedel (Econometrica 77(3):857-908, 2009). As in the classical case, it is optimal to stop if the current observation is a running maximum that exceeds certain decreasing thresholds. We characterize the history dependent minimizing measure and perform sensitivity analysis on two examples.
引用
收藏
页码:435 / 460
页数:26
相关论文
共 50 条