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

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

Author

Listed:
  • Ying-Fang Kao
  • K. Vela Velupillai

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.

Suggested Citation

  • Ying-Fang Kao & K. Vela Velupillai, 2012. "Reconstructing a Computable and Computationally Complex Theoretic Path Towards Simon's Behavioural Economics," ASSRU Discussion Papers 1222, ASSRU - Algorithmic Social Science Research Unit.
  • Handle: RePEc:trn:utwpas:1222
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Kumaraswamy Velupillai, "undated". "The Computable Approach to Economics," Working Papers _005, University of California at Los Angeles, Center for Computable Economics.
    2. Selda (Ying Fang) Kao & K. Vela Velupillai, 2011. "Behavioural Economics: Classical and Modern," ASSRU Discussion Papers 1126, ASSRU - Algorithmic Social Science Research Unit.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Bounded Rationality; Satisficing; Heuristics; Computability; Computational Complexity;

    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:1222. 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.