Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations (Q5321758): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On an optimal selection problem of Cowan and Zabczyk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pascal processes and their characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who solved the secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some time-invariant stopping rule problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707348 / 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: The Best Choice Problem for a Random Number of Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game version of the Cowan-Zabczyk-Bruss' problem / rank
 
Normal rank

Latest revision as of 18:29, 1 July 2024

scientific article; zbMATH DE number 5578815
Language Label Description Also known as
English
Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations
scientific article; zbMATH DE number 5578815

    Statements

    Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations (English)
    0 references
    0 references
    0 references
    15 July 2009
    0 references
    optimal stopping
    0 references
    Poisson arrival process
    0 references
    best choice problem
    0 references

    Identifiers