Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors

Obradović L (2018) Center for Mathematical Economics Working Papers; 580.
Bielefeld: Center for Mathematical Economics.

Download
OA 439.84 KB
Working Paper | Published | English
Author
Abstract
We consider a robust version of the full information best choice problem (Gilbert and Mosteller (1966)): there is ambiguity (represented by a set of priors) about the measure driving the observed process. We solve the problem under a very general class of multiple priors in the setting of Riedel (2009). As in the classical case, it is optimal to stop if the current observation is a running maximum that exceeds certain thresholds. We characterize the decreasing sequence of thresholds, as well as the (history dependent) minimizing measure. We introduce locally constant ambiguity neighborhood (LCAn) which has connections to coherent risk measures. Sensitivity analysis is performed using LCAn and exponential neighborhood from Riedel (2009).
Publishing Year
ISSN
PUB-ID

Cite this

Obradović L. Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors. Center for Mathematical Economics Working Papers. Vol 580. Bielefeld: Center for Mathematical Economics; 2018.
Obradović, L. (2018). Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors (Center for Mathematical Economics Working Papers, 580). Bielefeld: Center for Mathematical Economics.
Obradović, L. (2018). Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors. Center for Mathematical Economics Working Papers, 580, Bielefeld: Center for Mathematical Economics.
Obradović, L., 2018. Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors, Center for Mathematical Economics Working Papers, no.580, Bielefeld: Center for Mathematical Economics.
L. Obradović, Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors, Center for Mathematical Economics Working Papers, vol. 580, Bielefeld: Center for Mathematical Economics, 2018.
Obradović, L.: Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors. Center for Mathematical Economics Working Papers, 580. Center for Mathematical Economics, Bielefeld (2018).
Obradović, Lazar. Robust Maximum Detection: Full Information Best Choice Problem under Multiple Priors. Bielefeld: Center for Mathematical Economics, 2018. Center for Mathematical Economics Working Papers. 580.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Main File(s)
File Name
Access Level
OA Open Access
Last Uploaded
2018-01-22T14:34:49Z

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar