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

Secretary problems as a source of benchmark bounds

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

DOI10.1214/lnms/1215461963zbMath1400.60057OpenAlexW1590558289MaRDI QIDQ1624524

Stephen M. Samuels

Publication date: 16 November 2018

Full work available at URL: https://projecteuclid.org/euclid.lnms/1215461963


zbMATH Keywords

dynamic programmingoptimal stoppingbackward inductionbest choicerelative ranksgoogol


Mathematics Subject Classification ID

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


Related Items (5)

A note on bounds for the odds theorem of optimal stopping. ⋮ Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings ⋮ The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy ⋮ Sum the odds to one and stop ⋮ A new method for computing asymptotic results in optimal stopping problems




This page was built for publication: Secretary problems as a source of benchmark bounds

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