The finite-memory secretary problem

DOI10.1214/AOP/1176995774MaRDI QIDQ1248274zbMATH OpenOpenAlexFDO

Authors Herman Rubin, Stephen M. Samuels

Publication date 1977

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aop/1176995774

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Cited in

(6)

• Herbert Robbins and sequential analysis
• Best choice from the planar Poisson process
• Remarks on the Secretary Problem
• Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks
• scientific article; zbMATH DE number 7077336 (Why is no real title available?)
• Delay-tolerant delivery of quality information in ad hoc networks

This page was built for publication: The finite-memory secretary problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248274)