IDEAS home Printed from https://ideas.repec.org/p/trn/utwpas/1116.html
   My bibliography  Save this paper

Computable and Dynamical Systems Foundations of Bounded Rationality and Satisficing

Author

Listed:
  • K. Vela Velupillai

Abstract

Formally, the orthodox rational agentís 'Olympian' choices ([14], 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

Suggested Citation

  • K. Vela Velupillai, 2011. "Computable and Dynamical Systems Foundations of Bounded Rationality and Satisficing," ASSRU Discussion Papers 1116, ASSRU - Algorithmic Social Science Research Unit.
  • Handle: RePEc:trn:utwpas:1116
    as

    Download full text from publisher

    File URL: http://www.assru.economia.unitn.it/files/DP_4_2011_II.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. K. Vela Velupillai, 2005. "The impossibility of an effective theory of policy in a complex economy," Department of Economics Working Papers 0514, Department of Economics, University of Trento, Italia.
    2. Gilboa, Itzhak, 2012. "Rational Choice," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262518058, January.
    3. 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)

    More about this item

    Keywords

    Bounded Rationality; Decision Problems; Satisficing; Computability;

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C65 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Miscellaneous Mathematical Tools
    • C69 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Other
    • D03 - Microeconomics - - General - - - Behavioral Microeconomics: Underlying Principles

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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: (assru.tm@gmail.com). General contact details of provider: http://edirc.repec.org/data/detreit.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.