Content deleted Content added
free implementations on web |
|||
Line 67:
The odds-algorithm computes the optimal '''strategy''' and the '''optimal win probability''' at the same time. Also, the number of operations of the odds-algorithm is (sub)linear in n. Hence no quicker algorithm can possibly
exist for all sequences, so that the odds-algorithm is, at the same time, [[optimal]] as an algorithm.
==Source==
The odds algorithm is due to [[Bruss]] (2000) who coined this name. It is also known under the name Bruss-algorithm (strategy). A few free implementations can be found on the web.
==Applications==
Line 91 ⟶ 94:
* Shoo-Ren Hsiao and Jiing-Ru. Yang: ''Selecting the Last Success in Markov-Dependent Trials'', [[Journal of Applied Probability]], Vol. 93, 271–281, (2002.)
* B. Iung, E. Levrat and E. Thomas: ''Odds-Algorithm — based Opportunistic Maintenance Task Execution for Preserving Product Conditions'', [[CIRP-Annals]] Maintenance, Vol. 56, Issue 1, 13–16, (2007).
==Weblinks==
* Bruss-Algorithmus http://www.p-roesler.de/odds.html
[[Category:Mathematical optimization]]
| |||