scientific article; zbMATH DE number 6691960
From MaRDI portal
Publication:2965985
zbMATH Open1397.60080MaRDI QIDQ2965985FDOQ2965985
Publication date: 3 March 2017
Full work available at URL: https://dmtcs.episciences.org/2185/pdf
Title of this publication is not available (Why is that?)
optimalitymonotonicitymultiple stoppingunimodalitysecretary problemrelative ranksodds-theoremrecord-values
Online algorithms; streaming algorithms (68W27) Stopping times; optimal stopping problems; gambling theory (60G40)
Cited In (7)
- A rank-based approach to the sequential selection and assignment problem
- How to Select the Top k Elements from Evolving Data?
- Optimal selection based on relative ranks of a sequence by ties
- On optimal choosing of one of the \(k\) best objects.
- A unified approach for solving sequential selection problems
- Uniformly Bounded Regret in the Multisecretary Problem
- Optimal selection of the \(k\) best of a sequence with \(k\) stops
Recommendations
- A rank-based approach to the sequential selection and assignment problem 👍 👎
- On computing an optimal permutation of ranks for multiselection 👍 👎
- Optimal selection based on relative ranks of a sequence by ties 👍 👎
- Optimal selection of the \(k\) best of a sequence with \(k\) stops 👍 👎
- Selecting the most relevant elements from a ranking over sets 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965985)
