PROPHET SECRETARY
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10364804" target="_blank" >RIV/00216208:11320/17:10364804 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1137/15M1029394" target="_blank" >http://dx.doi.org/10.1137/15M1029394</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/15M1029394" target="_blank" >10.1137/15M1029394</a>
Alternative languages
Result language
angličtina
Original language name
PROPHET SECRETARY
Original language description
Optimal stopping theory is a powerful tool for analyzing scenarios such as online auctions in which we generally require optimizing an objective function over the space of stopping rules for an allocation process under uncertainty. Perhaps the most classic problems of stopping theory are the prophet inequality problem and the secretary problem. The classical prophet inequality states that by choosing the same threshold OPT/2 for every step, one can achieve the tight competitive ratio of 0.5. On the other hand, for the basic secretary problem, the optimal strategy achieves the tight competitive ratio of 1/e approximate to 0.36 In this paper, we introduce prophet secretary, a natural combination of the prophet inequality and the secretary problems.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA14-10003S" target="_blank" >GA14-10003S: Restricted computations: Algorithms, models, complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
SIAM Journal on Discrete Mathematics
ISSN
0895-4801
e-ISSN
—
Volume of the periodical
31
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
1685-1701
UT code for WoS article
000412161100011
EID of the result in the Scopus database
—