Reconstructing a Computable and Computationally Complex Theoretic Path Towards Simon's Behavioural Economics

Abstract

This paper aims to interpret and formalize Herbert Simon's notions of bounded rationality, satisficing and heuristics in terms of computability theory and computational complexity theory. Simon's theory of human problem solving is analysed in the light of Turing's work on Solvable and Unsolvable Problems. It is suggested here that bounded rationality results from the fact that the deliberations required for searching computationally complex spaces exceed the actual complexity that human beings can handle. The immediate consequence is that satisficing becomes the general criterion of decision makers and heuristics are the procedures used for achieving their goals. In such decision problems, it is demonstrated that bounded rationality and satisficing are more general than Olympian rationality and optimization, respectively, and not the other way about.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 0 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.