Odds algorithm: Difference between revisions

Revision as of 00:29, 16 March 2009

Revision as of 22:18, 19 July 2009

Line 69:

==Source==

The odds algorithm is due to [[F. ThomasT. Bruss]] (2000) who coined this name. It is also known under the name Bruss-algorithm (strategy). A few freeFree implementations can be found on the web.

==Applications==

Line 87:

== References ==

* [[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, (20062005).

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

* 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.)

* BE. IungThomas, E. Levrat, and EB. ThomasIung: ''Odds-AlgorithmL'algorithme —de basedBruss Opportunisticcomme Maintenancecontribtion Taskà Executionune formaintenance Preserving Product Conditionspréventive'', [[CIRP-AnnalsSciences et Technologies de l'automation]] Maintenance, Vol. 56, Issue 14, 13–16, -18 (2007).

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

==Weblinks==

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