Learning about the Optimal Stopping problem from "Algorithms to Live By" by Brian Christian & Tom Griffiths.

How to maximize your odds of picking the absolute best option in a pool of size N: 1) Reject the first N/e options (approx 37%) to establish a strict benchmark. 2) Instantly commit to the very next option that outperforms that baseline. Read more on the secretary problem math: en.wikipedia.org/wiki/Secretar #Math #AlgorithmsToLiveBy #DecisionMaking #Heuristics

Infographic on optimal stopping problems

← Mastodon archive