Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The senior and junior secretaries problem

From MaRDI portal
Publication:1319677
Jump to:navigation, search

DOI10.1016/0167-6377(93)90074-QzbMath0799.90117OpenAlexW2043678355MaRDI QIDQ1319677

J. Preater

Publication date: 12 April 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90074-q


zbMATH Keywords

thresholdsecretary problemoptimal selection policy


Mathematics Subject Classification ID

Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40)




Cites Work

  • Unnamed Item
  • Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
  • Who solved the secretary problem
  • The Secretary Problem with Optimal Assignment
  • On multiple stopping bales
  • The Optimal Choice of a Subset of a Population
  • Remarks on the Secretary Problem
  • Strategies for Sequential Search and Selection in Real Time
  • On Multiple Choice Secretary Problems


This page was built for publication: The senior and junior secretaries problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1319677&oldid=13440231"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki