An optimal choice problem for uniform random variables seen simultaneously or sequentially with availability depending on the observation. (Q1423038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.spl.2003.07.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080446937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-choice problems involving uncertainty of selection and recall of observations / 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: A secretary problem with uncertain employment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a single uncertain selection by recall of observations / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:53, 6 June 2024

scientific article
Language Label Description Also known as
English
An optimal choice problem for uniform random variables seen simultaneously or sequentially with availability depending on the observation.
scientific article

    Statements

    An optimal choice problem for uniform random variables seen simultaneously or sequentially with availability depending on the observation. (English)
    0 references
    0 references
    14 February 2004
    0 references
    Secretary problem
    0 references
    Uncertainty of selection
    0 references
    Backward solicitation
    0 references

    Identifiers