Abstract
Formally, the orthodox rational agent’s ‘Olympian’ choices ([9], p. 19) appear to be 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 by varieties of frameworks of theories of complexity.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A title that might be more appropriate would have been: Boundedly Rational Choice and Satisficing Decisions — Computable Foundations for a Complexity Theoretic Approach. This, while reflecting the main thrust of the contents of the paper, and its attempt at aiming to meet the stated scope of the event, is obviously too long. Hence the truncated, if also slightly less informative, title. Most importantly, however, the longer title would have signalled, explicitly, the way I am trying to meet Massimo Salzano’s abiding interests in the triptych of Bounded Rationality, Satisficing and Complexity — the latter, in particular, in all its many variations and formal splendour. I think it is my own long-standing interest and work in computable economics that first brought them to Massimo’s attention. Thus, the foundations in the title refers to those provided by computable economics. But I want to emphasize that computable here refers to both recursion theoretic and constructive aspects of that concept. This shift in trying to be more inclusive came about by my increasing discomfort with the strictures of the Church-Turing Thesis — a stricture that is nonbinding on the Brouwer-Bishop variant of constructive mathematics. My own adherence is to this variant of constructive mathematics, with a distinct slant towards the former, for its philosophical basis in intuitionism. I am confident Massimo Salzano would have approved my stance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Karp, Richard (1987), Complexity and Parallel Processing: An Interview with Richard Karp, a Turing Award Interview with Karen A. Frenkel, in: ACM Turing Award Lectures — The First Twenty years, 1966–1985, ACM Press/ Addison-Wesley Publishing Company, Reading, Massachusetts
Newell, Allen and Herbert. A Simon (1972), Human Problem Solving, Prentice-Hall, Inc., Englewood Cliffs, New Jersey
Rubinstein, Ariel (1998), Modelling Bounded Rationality, The MIT Press, Cambridge, Massachusetts
Salzano, Massimo (1998), Control of the Complex Economy through Fiscal Variables, Economics & Complexity, Spring, pp. 45–68
Salzano, Massimo and David Colander (2007), Complexity Hints for Economic Policy, Springer-Verlag Italia, Milan
Samuelson, Paul Anthony, (1971), Maximum Principles in Analytical Economics, pp. 273–288; in: Les prix Nobel en 1970, The Nobel Foundation, Stockholm
Schrijver, Alexander (1986), Theory of Linear and Integer Programming, John Wiley & Sons, Chichester & New York
Simon, Herbert A (1956), Rational Choice and the Structure of the Environment, Psychological Review, Vol. 63, pp. 129–38. Reprinted as chapter 1.2, pp. 20–28, in: Models of Thought, Vol. 1, Yale University Press, New Haven
Simon, Herbert A (1983), Reason in Human Affairs, Basil Blackwell, Oxford
Simon, Herbert A (1986), Rationality in Psychology and Economics, The Journal of Business, Vol. 59, # 4, Pt. 2, October, pp. S209–S224
Simon, Herbert A (1996), Machine as Mind, Chapter 5, pp. 81–101, in: Machines and Thought — The Legacy of Alan Turing, Volume 1, edited by Peter Macmillan and Andy Clark, Oxford University Press, Oxford
Velupillai, Kumaraswamy (2000), Computable Economics, Oxford University Press, Oxford
Velupillai, K. Vela (2007), The Impossibility of an Effective Theory of Policy in a Complex Economy, pp. 273–290, in: Complexity Hints for Economic Policy, edited by Massimo Salzano & David Colander, Springer-Verlag Italia, Milano & Heidelberg
Velupillai, K. Vela (2009) A Computable Economist’s Perspective on Computational Complexity, in: Handbook of Research on Complexity, edited by J. Barkley Rosser, Jr., Chapter 4, pp. 36–83, Edward Elgar Publishing Limited, Cheltenham and Massachusetts
Velupillai, K. Vela & Stefano Zambelli (2009), Dynamic Complexity, Nonlinearity and Emergence, Manuscript, Trento, January
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Dedicated to the Memory of Massimo Salzano Scholar and Friend†
Rights and permissions
Copyright information
© 2010 Springer-Verlag Italia
About this paper
Cite this paper
Velupillai, K.V. (2010). Complexity Theoretic Bounded Rationality and Satisficing. In: Faggini, M., Vinci, C.P. (eds) Decision Theory and Choices: a Complexity Approach. New Economic Windows. Springer, Milano. https://doi.org/10.1007/978-88-470-1778-8_2
Download citation
DOI: https://doi.org/10.1007/978-88-470-1778-8_2
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-1777-1
Online ISBN: 978-88-470-1778-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)