Odds algorithm: Difference between revisions

Revision as of 22:18, 19 July 2009

Revision as of 17:23, 31 July 2009

Line 11:

real-world situations.

==Examples==

Two different situations exemplify the interest in maximizing the probability to stop on a last specific event.

Line 89:

* [[F. Thomas Bruss]]:'' Sum the Odds to One and Stop'', [[Annals of Probability]] Vol. 28, 1384–1391 (2000).

* —:'' A note on Bounds for the Odds-Theorem of Optimal Stopping'', [[Annals of Probability]] Vol. 31, 1859–1862, (2003).

* —:'' The art of a right decision.'' Newsletter of the [[European Mathematical Society ]], Issue 62, 14–20, (2005).

* Mitsushi Tamaki:''Optimal Stopping on Trajectories and the Ballot Problem'', [[Journal of Applied Probability]] Vol. 38, 946–959 (2001).

* Shoo-Ren Hsiao and Jiing-Ru. Yang: ''Selecting the Last Success in Markov-Dependent Trials'', [[Journal of Applied Probability]], Vol. 93, 271–281, (2002.)

* E. Thomas, E. Levrat, B. Iung: ''L'algorithme de Bruss comme contribtion à une maintenance préventive'', [[Sciences et Technologies de l'automation]], Vol. 4, 13-18 (2007).

*T.S. Ferguson: (2008, unpublished)

==WeblinksExternal links==

* Bruss-Algorithmus http://www.p-roesler.de/odds.html

* http://www.economy-point.org/o/odds-strategy.html

{{DEFAULTSORT:Odds Algorithm}}

[[Category:Mathematical optimization]]