Why do these quite different best-choice problems have the same solutions? (Q4819488): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Choosing the best of the current crop / 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: On a best choice problem with partial information / 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

Latest revision as of 20:05, 6 June 2024

scientific article; zbMATH DE number 2103395
Language Label Description Also known as
English
Why do these quite different best-choice problems have the same solutions?
scientific article; zbMATH DE number 2103395

    Statements

    Why do these quite different best-choice problems have the same solutions? (English)
    0 references
    0 references
    24 September 2004
    0 references
    secretary problem
    0 references
    optimal stopping
    0 references
    planar Poisson process
    0 references

    Identifiers