Skip to Main content Skip to Navigation
Journal articles

Sequential selection of the k best out of n rankable objects

Abstract : 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 best of these n uniquely rankable objects. This focus is motivated by the fact that it is hard to find closed form solutions of optimal strategies for general k and n. Selection is without recall, and the idea is to investigate threshold functions which maintain all present information, that is thresholds which are functions of all selections made so far. Our main interest lies in the asymptotic behaviour of these thresholds as n -> infinity and in the corresponding asymptotic performance of the threshold algorithm.
Document type :
Journal articles
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Guy Louchard <>
Submitted on : Friday, September 23, 2016 - 10:37:13 AM
Last modification on : Thursday, June 4, 2020 - 10:38:02 AM
Long-term archiving on: : Saturday, December 24, 2016 - 12:13:47 PM


Files produced by the author(s)


  • HAL Id : hal-01208327, version 3



F. Thomas Bruss, Guy Louchard. Sequential selection of the k best out of n rankable objects. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 18, no 3. ⟨hal-01208327v3⟩



Record views


Files downloads