Invariant record processes and applications to best choice modelling (Q1116180): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: F. Thomas Bruss / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: J. Gianini Pettitt / rank
Normal rank
 
Property / author
 
Property / author: F. Thomas Bruss / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: J. Gianini Pettitt / rank
 
Normal rank
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/0304-4149(88)90091-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087351410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Records from improving populations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical decision theory. Foundations, concepts, and methods / rank
 
Normal rank
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: A unified approach to a class of optimal selection problems with an unknown number of options / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal selection problem of Cowan and Zabczyk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3756283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete characterization of the upper and lower class of the record and inter-record times of an I.I.D. sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Secretary Problem and Its Extensions: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random record models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infinite secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k-record processes are i.i.d. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the best-choice problem when the number of observations is random / 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: Q5514924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Secretary Problem with an Unknown Number of Options / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON Rényi's “Record” Problem and Engel's Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic results for the best-choice problem with a random number of objects / rank
 
Normal rank

Latest revision as of 13:14, 19 June 2024

scientific article
Language Label Description Also known as
English
Invariant record processes and applications to best choice modelling
scientific article

    Statements

    Invariant record processes and applications to best choice modelling (English)
    0 references
    1988
    0 references
    Let \(X_ 1,X_ 2,...,X_ n\) be a sequence of independent, identically distributed random variables. \(X_ j\) is said to be an r-record if \(X_ j\) is the r-th largest amongst \(X_ 1,...,X_ j\). Optimal selection based on relative ranks can be considered as a record problem. In fact, by considering the generating function of the number of r-records after index j and up to index n, all the classical results concerning the problem of maximizing the probability of choosing the best (highest) observation if only one selection is allowed, can be rederived simply and elegantly. This method can moreover be extended to include: - the problem of maximizing the probability of making the best selection if several choices are allowed; - the problem of maximizing a more complex reward function; - the case where the number n of observations is unknown, but is a random variable N with known distribution; - under certain conditions, the case where the number n of observations is unknown, and its distribution is also unknown.
    0 references
    optimal stopping
    0 references
    record problem
    0 references
    generating function
    0 references
    maximizing the probability of choosing the best
    0 references
    0 references

    Identifiers