Historically, Optimal Stopping problems have been applied in various fields such as mathematics, economics, and computer science. For instance, in the 1950s, the 'Secretary Problem' was a famous example where an employer has to decide when to stop interviewing and hire a candidate. Another example is the 'American Option Pricing' in financial mathematics, where one has to decide the optimal time to exercise an option. In computer science, 'Bandit problems' are a classic example of optimal stopping, where an algorithm has to decide when to stop exploring and exploit the best option.
Can computer science teach us the secrets of life? Perhaps not, but they can shed light on how certa...
View summary