An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object (Q5488991): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A unified approach to a class of best choice problems with an unknown number of options / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal rules for the sequential selection of monotone subsequences of maximum expected length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the full information best-choice problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best choice from the planar Poisson process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objectives in the Best-Choice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a best choice problem with partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The full-information best choice problem with a random number of observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On best choice problems having similar solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Best Choice Problem for a Random Number of Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infinite secretary problem with recall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitesimal Look-Ahead Stopping Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why do these quite different best-choice problems have the same solutions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Secretary Problem with Finite Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-information best-choice problem with finite memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing the maximum of a random sequence based on relative rank with backward solicitation / rank
 
Normal rank

Latest revision as of 19:39, 24 June 2024

scientific article; zbMATH DE number 5056744
Language Label Description Also known as
English
An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
scientific article; zbMATH DE number 5056744

    Statements

    An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object (English)
    0 references
    0 references
    0 references
    25 September 2006
    0 references
    optimal stopping
    0 references
    secretary problem
    0 references
    \(e^{-1}\)-law
    0 references
    duration problem
    0 references
    planar Poisson process
    0 references
    monotone subsequence problem
    0 references

    Identifiers