Solving optimal stopping problems with statistical algorithms
Las Vegas and Everyday Life
Just as there are correct and incorrect ways of winning at certain games in Las Vegas – and although I am amazed at how few people actually take them into consideration to at least statistically give the casino as little chance as possible to win – it is important in everyday life to keep the upper hand in randomly driven processes and always consider the most likely possible outcome of such a situation.
However, what is demonstrably the optimal strategy, if you do the math, is sometimes of little practical value for stop problems. In a casino that pays back triple your bet after tossing a coin with a winning percentage of 50 percent, the theoretically correct approach would be to keep on playing and never quit. But, as you can imagine, the players would go home bankrupt every time if they followed this strategy.
Infos
- Secretary problem: https://en.wikipedia.org/wiki/Secretary_problem
- Optimal stopping: https://en.wikipedia.org/wiki/Optimal_stopping
- Christian, Brian, and Tom Griffiths. Algorithms to Live By: The Computer Science of Human Decisions. Henry Holt and Co. April 2016: http://algorithmstoliveby.com
- Vitality curve: https://en.wikipedia.org/wiki/Vitality_curve
- Listings for this article: ftp://ftp.linux-magazine.com/pub/listings/magazine/190
« Previous 1 2
Buy this article as PDF
(incl. VAT)