Geodesic
Sequential selection of the k best out of nrankable objects
Discrete mathematics & theoretical computer science, Tome 18 (2015-2016) no. 3.

Voir la notice de l'article provenant de la source Episciences

The objective of this paper is to find in a setting of n sequential observations of objects a good online policy to select the k bestof these n uniquely rankable objects. This focus is motivated by the fact that it is hard to find closed form solutions of optimalstrategies for general k and n. Selection is without recall, and the idea is to investigate threshold functions which maintain allpresent information, that is thresholds which are functions of all selections made so far. Our main interest lies in the asymptoticbehaviour of these thresholds as n -> infinity and in the corresponding asymptotic performance of the threshold algorithm. 
@article{DMTCS_2016_18_3_a14,
     author = {Bruss, F. Thomas and Louchard, Guy},
     title = {Sequential selection of the k best out of nrankable objects},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2015-2016},
     doi = {10.46298/dmtcs.1291},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1291/}
}
TY  - JOUR
AU  - Bruss, F. Thomas
AU  - Louchard, Guy
TI  - Sequential selection of the k best out of nrankable objects
JO  - Discrete mathematics & theoretical computer science
PY  - 2015-2016
VL  - 18
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1291/
DO  - 10.46298/dmtcs.1291
LA  - en
ID  - DMTCS_2016_18_3_a14
ER  - 
%0 Journal Article
%A Bruss, F. Thomas
%A Louchard, Guy
%T Sequential selection of the k best out of nrankable objects
%J Discrete mathematics & theoretical computer science
%D 2015-2016
%V 18
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1291/
%R 10.46298/dmtcs.1291
%G en
%F DMTCS_2016_18_3_a14
Bruss, F. Thomas; Louchard, Guy. Sequential selection of the k best out of nrankable objects. Discrete mathematics & theoretical computer science, Tome 18 (2015-2016) no. 3. doi : 10.46298/dmtcs.1291. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1291/

Cité par Sources :