People and computers settle for “good enough” solutions because of bounded rationality
Simon called this bounded rationality: nobody can analyze absolutely every possible option before deciding. When choosing dinner, you do not compare every recipe in the world; you settle on the first reasonable option found quickly. Computer algorithms use the same strategy, searching for good solutions rather than perfect ones.
Why it matters The idea directly influenced how search algorithms used everywhere today are designed.