A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank
From MaRDI portal
Publication:3621144
Recommendations
- scientific article; zbMATH DE number 939771
- Expected duration of the no-information minimum rank problem
- The secretary problem: minimizing the expected rank with I.I.D. random variables
- The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations
- Ranking and empirical minimization of \(U\)-statistics
- Minimizing the expected rank with full information
- Continuum armed bandit problem of few variables in high dimensions
- scientific article; zbMATH DE number 1457529
Cites work
- scientific article; zbMATH DE number 3126759 (Why is no real title available?)
- scientific article; zbMATH DE number 939771 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Approximation of optimal stopping problems.
- Minimizing the expected rank with full information
- Optimal Stopping with Rank-Dependent Loss
- Optimal selection based on relative rank (the 'Secretary Problem')
- The secretary problem: minimizing the expected rank with I.I.D. random variables
- What is Known About Robbins' Problem?
Cited in
(7)- Mathematical intuition, deep learning, and Robbins' problem
- No-information secretary problems with cardinal payoffs and Poisson arrivals
- A random walk version of Robbins' problem: small horizon
- A new strategy for Robbins' problem of optimal stopping
- What is Known About Robbins' Problem?
- Sum the multiplicative odds to one and stop
- Optimal choice of the best available applicant in full-information models
This page was built for publication: A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621144)
