A generalization of the classical secretary problem: dependent arrival sequences

DOI10.2307/3214237zbMath0647.62081OpenAlexW2319417664MaRDI QIDQ3792103

No author found.

Publication date: 1988

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214237

zbMATH Keywords

secretary problemdependent arrival sequences

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Sequential estimation (62L12) Optimal stopping in statistics (62L15)

Related Items (3)

Opportunity costs in the game of best choice ⋮ Avoiding patterns and making the best choice ⋮ Weighted Games of Best Choice

This page was built for publication: A generalization of the classical secretary problem: dependent arrival sequences