IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

Computable and Dynamical Systems Foundations of Bounded Rationality and Satisficing

  • K. Vela Velupillai
Registered author(s):

    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

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

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

    Paper provided by ASSRU - Algorithmic Social Science Research Unit in its series ASSRU Discussion Papers with number 1116.

    as
    in new window

    Length:
    Date of creation: 2011
    Date of revision:
    Handle: RePEc:trn:utwpas:1116
    Contact details of provider: Postal: Via Inama 5, 38100 Trento
    Phone: +39-461-882201
    Fax: +39-461-882222
    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.:

    as in new window
    1. K. Vela Velupillai, 2005. "The impossibility of an Effective Theory of Policy in a Complex Economy," Working Papers 0094, National University of Ireland Galway, Department of Economics, revised 2005.
    2. Gilboa, Itzhak, 2012. "Rational Choice," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262518058, June.
    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)

    This item is not listed on Wikipedia, on a reading list or among the top 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: (assru.tm@gmail.com)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.