A generalization of the classical secretary problem: dependent arrival sequences

DOI10.2307/3214237MaRDI QIDQ3792103zbMATH OpenOpenAlexFDO

Authors

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

dependent arrival sequencessecretary problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4031386
• The secretary problem with biased arrival order via a Mallows distribution
• Some Extensions of Generalized Secretary Problem
• APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
• Stochastic sequential assignment problem with arrivals
• The Secretary Problem and Its Extensions: A Review
• Improved algorithms and analysis for secretary problems and generalizations
• Sooner and later waiting time problems based on a dependent sequence

Cited in

(5)

• Opportunity costs in the game of best choice
• Avoiding patterns and making the best choice
• Secretary problem with hidden information; searching for a high merit candidate
• scientific article; zbMATH DE number 4031386 (Why is no real title available?)
• Weighted games of best choice

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

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