Optimal sequential selection of a gambler assessed by the prophet

Please use this identifier to cite or link to this item:
https://osnadocs.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2001030919
Open Access logo originally created by the Public Library of Science (PLoS)
Title: Optimal sequential selection of a gambler assessed by the prophet
Authors: Laumann, Werner
Thesis advisor: Prof. Dr. Wolfgang Stadje
Thesis referee: Priv.-Doz. Dr. Alexander Gnedin
Abstract: In this thesis an optimal stopping problem related to the classical secretary problem is studied. The theory of optimal stopping represents a special branch of stochastic optimization. Here the socalled full information best choice problem with a known number of offers is generalized by maximizing the probability of selecting an r-candidate, where an offer is called r-candidate if it is not lower than the maximal offer reduced by function r. In the first part discrete time is investigated. For this optimal stopping problem to select an r-candidate an optimal stopping time is indicated, the suboptimal myopic stopping time is displayed and threshold rules are studied including asymptotic behaviour. The basis of this optimal stopping problem is displayed in a general setting where the payoff depends on the prophet´s choiceand on the maximal offer, i.e. the value of the prophet. As a further application the mean of the ratio of the gambler´s choice and prophet´s value is investigated. Then in the second part offers arrive in continuous time. Offers are presented according to random arrival times and the horizon terminating the period of choosing is taken to be fixed and random. Here stress is layed on the geometric and on the exponential distribution, i.e. the Poisson process. In the final part the optimal stopping problem of maximizing the duration of owning a sufficiently good offer is applied to the concept of an r-candidate. A distinction between an overall and a temporary r-candidate is made. The duration of owning an r-candidate is investigated for a finite number of offers with regard to recall. The duration problem with discounted epochs is resolved. Finally the duration of owning an r-candidate is considered regarding the Poisson process where the horizon is fixed and exponentially distributed.
URL: https://repositorium.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2001030919
Subject Keywords: full information; best choice; secretary problem; candidate problem; duration problem
Issue Date: 9-Mar-2001
Type of publication: Dissertation oder Habilitation [doctoralThesis]
Appears in Collections:FB06 - E-Dissertationen

Files in This Item:
File Description SizeFormat 
E-Diss115_thesis.tar.gz541,6 kBGZIP
E-Diss115_thesis.tar.gz
View/Open
E-Diss115_thesis.pdfPräsentationsformat822,6 kBAdobe PDF
E-Diss115_thesis.pdf
Thumbnail
View/Open


Items in osnaDocs repository are protected by copyright, with all rights reserved, unless otherwise indicated. rightsstatements.org