Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items

DOI10.1016/0304-4149(91)90086-RzbMath0736.60040MaRDI QIDQ1180196

John G. Wilson

Publication date: 27 June 1992

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

optimal stoppingsecretary problemranking and selectionstructure of optimal strategies

Mathematics Subject Classification ID

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

Related Items (5)

Prophet Secretary ⋮ Prophet Secretary ⋮ Optimal selection of the \(k\) best of a sequence with \(k\) stops ⋮ Unnamed Item ⋮ The senior and junior secretaries problem

Cites Work

• The Secretary Problem with Optimal Assignment
• The Secretary Problem and Its Extensions: A Review
• Optimal Sequential Assignment
• A SECRETARY PROBLEM WITH DOUBLE CHOICES
• Recognizing both the maximum and the second maximum of a sequence
• The Optimal Choice of a Subset of a Population
• A Problem of Optimal Choice and Assignment
• On a Generalization of the Best Choice Problem
• A Generalized Problem of Optimal Selection and Assignment
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items