Computable and Dynamical Systems Foundations of Bounded Rationality and Satisficing
Formally, the orthodox rational agentís 'Olympian' choices (, p.19) are made in a static framework. However, a formalization of consistent choice, underpinned by computability, suggests satisficing in a boundedly rational framework is not only more general than the model of 'Olympian' rationality; it is also consistently dynamic. This kind of naturally process-oriented approach to the formalization of consistent choice can be interpreted and encapsulated within the framework of decision problems - in the formal sense of metamathematics and mathematical logic - which, in turn, is the natural way of formalizing the notion of Human Problem Solving in the Newell-Simon sense. Casting Simon's insights and suggestions on boundedly rational, satisficing and adaptive choice in the formalisms of time computational complexity theory and algorithmic dynamics makes it possible to take some small first steps in the direction of a formal demonstration of this proposition. A more complete attempt would require the additional consideration of space computational complexity, which will be the next step in this research program. The latter consideration would allow one to go beyond the P?=NP conundrum and thereby justify the relative, implicit unimportance, Simon gave this issue
|Date of creation:||2011|
|Contact details of provider:|| Postal: Via Inama 5, 38100 Trento|
Web page: http://www.assru.economia.unitn.it/index.html
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Gilboa, Itzhak, 2012.
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262518058, July.
- Itzhak Gilboa, 2010. "Rational Choice," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262014009, July.
- K. Vela Velupillai, 2007. "A Computable Economist’s Perspective on Computational Complexity," Department of Economics Working Papers 0723, Department of Economics, University of Trento, Italia. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:trn:utwpas:1116. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (email@example.com)
If references are entirely missing, you can add them using this form.