Books and journals Case studies Expert Briefings Open Access
Advanced search

Bounded Rationality, Heuristics, Computational Complexity, and Artificial Intelligence

Richard A. Bettis
Songcui Hu

Behavioral Strategy in Perspective

ISBN: 978-1-78756-348-3, eISBN: 978-1-78756-347-6

ISSN: 0742-3322

Publication date: 21 September 2018

Abstract

Herbert A. Simon and Alan Newell won the Turing Award jointly in Computer Science for foundational work on Artificial Intelligence. Simon also won the Nobel Prize in Economics for the concept of “bounded rationality.” In both cases, the same heuristic was deemed fundamental: “Search till a satisfactory solution is found.” We argue that behavioral strategy can learn a great deal from the Theory of Computational Complexity and Artificial Intelligence. These fields can provide a sounder theoretical grounding for bounded rationality and for the necessity and usefulness of heuristics. Finally, a concept of “organizational intractability” based roughly on the metaphor provided by the Theory of Computational Complexity may be useful in determining what analytical decision technologies are actually intractable in real organizations with constraints on time and managerial attention.

Keywords

  • Bounded rationality
  • Heuristics
  • Computational complexity
  • Behavioral strategy

Acknowledgements

Acknowledgments

The authors would like to thank Michelle Rogan and Isin Guler for their insightful comments on an earlier draft. They greatly improved the quality of the paper. Any remaining errors are the authors’ responsibility. This paper is dedicated to Anna Quinn Bettis, the first granddaughter of the first author born on October 15, 2017.

Citation

Bettis, R.A. and Hu, S. (2018), "Bounded Rationality, Heuristics, Computational Complexity, and Artificial Intelligence", Behavioral Strategy in Perspective (Advances in Strategic Management, Vol. 39), Emerald Publishing Limited, pp. 139-150. https://doi.org/10.1108/S0742-332220180000039010

Download as .RIS

Publisher

:

Emerald Publishing Limited

Copyright © 2018 Emerald Publishing Limited

Please note you do not have access to teaching notes

You may be able to access teaching notes by logging in via Shibboleth, Open Athens or with your Emerald account.
Login
If you think you should have access to this content, click the button to contact our support team.
Contact us

To read the full version of this content please select one of the options below

You may be able to access this content by logging in via Shibboleth, Open Athens or with your Emerald account.
Login
If you think you should have access to this content, click the button to contact our support team.
Contact us
Emerald Publishing
  • Opens in new window
  • Opens in new window
  • Opens in new window
  • Opens in new window
© 2021 Emerald Publishing Limited

Services

  • Authors Opens in new window
  • Editors Opens in new window
  • Librarians Opens in new window
  • Researchers Opens in new window
  • Reviewers Opens in new window

About

  • About Emerald Opens in new window
  • Working for Emerald Opens in new window
  • Contact us Opens in new window
  • Publication sitemap

Policies and information

  • Privacy notice
  • Site policies
  • Modern Slavery Act Opens in new window
  • Chair of Trustees governance statement Opens in new window
  • COVID-19 policy Opens in new window
Manage cookies

We’re listening — tell us what you think

  • Something didn’t work…

    Report bugs here

  • All feedback is valuable

    Please share your general feedback

  • Member of Emerald Engage?

    You can join in the discussion by joining the community or logging in here.
    You can also find out more about Emerald Engage.

Join us on our journey

  • Platform update page

    Visit emeraldpublishing.com/platformupdate to discover the latest news and updates

  • Questions & More Information

    Answers to the most commonly asked questions here