TY  - CHAP
AB  - Abstract Herbert A. Simon and Alan Newell won the Turing Award jointly in Computer Science for foundational work on Artificial Intelligence. Simon also won the Nobel Prize in Economics for the concept of “bounded rationality.” In both cases, the same heuristic was deemed fundamental: “Search till a satisfactory solution is found.” We argue that behavioral strategy can learn a great deal from the Theory of Computational Complexity and Artificial Intelligence. These fields can provide a sounder theoretical grounding for bounded rationality and for the necessity and usefulness of heuristics. Finally, a concept of “organizational intractability” based roughly on the metaphor provided by the Theory of Computational Complexity may be useful in determining what analytical decision technologies are actually intractable in real organizations with constraints on time and managerial attention.
VL  - 39
SN  - 978-1-78756-348-3, 978-1-78756-347-6/0742-3322
DO  - 10.1108/S0742-332220180000039010
UR  - https://doi.org/10.1108/S0742-332220180000039010
AU  - Bettis Richard A.
AU  - Hu Songcui
PY  - 2018
Y1  - 2018/01/01
TI  - Bounded Rationality, Heuristics, Computational Complexity, and Artificial Intelligence
T2  - Behavioral Strategy in Perspective
T3  - Advances in Strategic Management
PB  - Emerald Publishing Limited
SP  - 139
EP  - 150
Y2  - 2024/04/23
ER  -