The finite-memory secretary problem

DOI10.1214/AOP/1176995774zbMATH Open0381.60036OpenAlexW2077936998MaRDI QIDQ1248274FDOQ1248274

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)

• Remarks on the Secretary Problem
• Herbert Robbins and sequential analysis
• Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks
• Delay-tolerant delivery of quality information in ad hoc networks
• Best choice from the planar Poisson process
• Title not available (Why is that?)

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)