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

Dynamic programming and the secretary problem

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

DOI10.1016/0898-1221(90)90145-AzbMath0706.90089MaRDI QIDQ918875

Martin J. Beckmann

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)


zbMATH Keywords

secretary problem


Mathematics Subject Classification ID

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


Related Items (1)

The secretary recommendation problem




Cites Work

  • Finite state Markovian decision processes
  • Dynamic Programming and Decision Theory
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Dynamic programming and the secretary problem

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