IDEAS home Printed from https://ideas.repec.org/p/cla/najeco/666156000000000082.html
   My bibliography  Save this paper

Limited Computational Resources Favor Rationality

Author

Listed:
  • Yuval Salant

Abstract

No abstract is available for this item.

Suggested Citation

  • Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," NajEcon Working Paper Reviews 666156000000000082, www.najecon.org.
    • Handle: RePEc:cla:najeco:666156000000000082
    as

    Download full text from publisher

    File URL: http://www.najecon.org/v6.htm
    File Function: brief review and links to paper
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dinko Dimitrov & Saptarshi Mukherjee & Nozomu Muto, 2013. "List-based decision problems," UFAE and IAE Working Papers 927.13, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    2. Apesteguia, Jose & Ballester, Miguel A., 2010. "The Computational Complexity of Rationalizing Behavior," Journal of Mathematical Economics, Elsevier, vol. 46(3), pages 356-363, May.
    3. Guney, Begum, 2014. "A theory of iterative choice in lists," Journal of Mathematical Economics, Elsevier, vol. 53(C), pages 26-32.
    4. Jose Apesteguia & Miguel A. Ballester, 2007. "On the complexity of rationalizing behavior," Economics Working Papers 1048, Department of Economics and Business, Universitat Pompeu Fabra.
    5. Yongjie Yang & Dinko Dimitrov, 2019. "The complexity of shelflisting," Theory and Decision, Springer, vol. 86(1), pages 123-141, February.
    6. Brenčič, Vera, 2014. "Search online: Evidence from acquisition of information on online job boards and resume banks," Journal of Economic Psychology, Elsevier, vol. 42(C), pages 112-125.
    7. Dinko Dimitrov & Saptarshi Mukherjee & Nozomu Muto, 2016. "‘Divide-and-choose’ in list-based decision problems," Theory and Decision, Springer, vol. 81(1), pages 17-31, June.

    More about this item

    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:cla:najeco:666156000000000082. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: David K. Levine (email available below). General contact details of provider: http://www.najecon.org/ .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.