Construct · 4 names · 5 citations
Different names. Different fields. One construct. One map.
● jangle · limited minds, four programs Nearest construct by meaningreasonablenesscompare the meaningsEvery construct on the map is compared with every other by the meaning of its definitions, and the closest one is surfaced here. The nearest construct to bounded rationality is reasonableness.
Hold this as a prompt, not a verdict. Two constructs sitting close in meaning is a reason to read them side by side and decide for yourself whether they are one idea under two names. It is not proof that they are. Compare the meanings in the Collider.
Spokes are the names and the models that coined them; dashed arcs are borrowings. Tap a field for its definition, unit, and measures.
Drag to watch the word get claimed. Each name appears at the publication date of the earliest source cited for it. Tap a year to see which.
The idea in its original economic form: because a chooser has limited information, limited computation, and limited time, they cannot solve the optimization problem that classical theory assumes, and instead work within a drastically simplified model of the world. Simon's 1955 A behavioral model of rational choice replaced the maximizing agent with one who searches until an option clears an aspiration level and then stops, a rule he later called satisficing, and distinguished substantive rationality, judged by the outcome, from procedural rationality, judged by the process of choosing. The referent is the choosing agent's actual, resource-limited procedure, not an ideal that always computes the best act.[1]
Bounded rationality as psychologists have filled it in: accounts of the actual mental procedures a limited mind uses to decide. Two traditions read Simon's programme in opposite keys. Kahneman's 2003 Maps of bounded rationality treats the heuristics people substitute for hard judgements as a source of systematic bias, mapping where intuition departs from the normative model. Gigerenzer and Goldstein's 1996 Reasoning the fast and frugal way treats simple heuristics such as take-the-best as ecologically rational, often matching or beating information-hungry models when data are scarce. Both fill the empty slot Simon left, the second blade of his scissors of cognition and environment, but one counts the bounds as flaws and the other as fit.[2][3]
The same premise carried up from the individual to the firm: if managers cannot optimize, the organizations they build are structures for coping with cognitive limits. Cyert and March's A behavioral theory of the firm, first published in 1963, made bounded rationality a foundation stone, describing firms that satisfice against aspiration levels, search only when performance falls short, and lean on standard operating procedures and organizational routines to economize on attention. The referent moves from a single mind to the division of decision labour across a coalition, where structure, rules, and slack stand in for the omniscience the firm does not have.[4]
The idea recast as an engineering standard for machines. Classical AI took perfect rationality, always choosing the best act, as the goal, but a real agent runs on finite hardware in real time and cannot compute it. Russell and Subramanian's 1995 Provably bounded-optimal agents proposed bounded optimality as the replacement: an agent program is bounded-optimal if it is the best program its machine can run in its task environment, so the optimization is over programs subject to computational constraints rather than over acts assuming unlimited computation. Here bounded rationality stops being an empirical description of people and becomes a formal criterion an artificial agent can be proven to meet.[5]
Next
See how bounded rationality sits against neighbouring constructs in the Collider, or export every reference on this page in one click.
Open in ColliderExport BibTeXReport this collisionCited on this page?
If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.
Claim your construct