Revision as of 15:08, 4 April 2025 edit Cmglee (talk \| contribs) Extended confirmed users 12,400 edits →Applications: Add secretary problem illustration ← Previous edit		Latest revision as of 20:35, 3 August 2025 edit undo Rjjiii (talk \| contribs) Extended confirmed users, Rollbackers, Template editors 15,529 edits format as Template:wikicite
Line 100: "[https://www.cambridge.org/core/journals/journal-of-applied-probability/article/note-on-a-lower-bound-for-the-multiplicative-odds-theorem-of-optimal-stopping/B759B6E4A9D83DB84D6EE1B4C827785B A note on Bounds for the Odds Theorem of Optimal Stopping]", ''[[Annals of Probability]]'' Vol. 31, 1859–1862, (2003). "[https://web.archive.org/web/20230409100437/https://www.ems-ph.org/journals/newsletter/pdf/2006-12-62.pdf The art of a right decision]", ''Newsletter of the [[European Mathematical Society]]'', Issue 62, 14–20, (2005). {{~~SfnRef~~wikicite ~~inline~~\|ref={{SfnRef\|Ferguson\|2008}} \|reference=[[Thomas S. Ferguson\|T. S. Ferguson]]: (2008, unpublished)}}{{sfn whitelist\|CITEREFFerguson2008}} {{cite journal \|first1=F. T. \|last1=Bruss \|first2=D. \|last2=Paindaveine \|title=Selecting a sequence of last successes in independent trials \|journal=Journal of Applied Probability \|volume=37 \|pages=389–399 \|year=2000 \|issue=2 \|doi=10.1239/jap/1014842544 \|url=https://mpra.ub.uni-muenchen.de/21166/1/MPRA_paper_21166.pdf}} *{{Cite journal\|last1=Gilbert \|first1=J \|last2=Mosteller \|first2=F \|title= Recognizing the Maximum of a Sequence \|journal=Journal of the American Statistical Association \|volume=61 \|pages=35–73 \|year=1966 \|issue=313 \|doi=10.2307/2283044 \|jstor=2283044 }}

Odds algorithm: Difference between revisions