Bounded rationality in problem solving: Guiding search with domain-independent heuristics

Mind and Society 13 (1):83-95 (2014)
  Copy   BIBTEX

Abstract

Humans exhibit the remarkable ability to solve complex, multi-step problems despite their limited capacity for search. We review the standard theory of problem solving, which posits that heuristic guidance makes this possible, but we also note that most studies have emphasized the role of domain-specific heuristics, which are not available for unfamiliar tasks, over more general ones. We describe FPS, a flexible architecture for problem solving that supports a variety of different strategies and heuristics, and we report its use in an experiment that studies the effectiveness of two domain-independent criteria. The results suggest that such heuristics can make problem solving far more tractable, and they are generally consistent with our claim that their use offsets the drawbacks of bounded rationality.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-01-22

Downloads
13 (#288,494)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Simple Heuristics That Make Us Smart.Gerd Gigerenzer, Peter M. Todd & A. B. C. Research Group - 1999 - New York, NY, USA: Oxford University Press USA. Edited by Peter M. Todd.
Computer science as empirical inquiry: Symbols and search.Allen Newell & Herbert A. Simon - 1981 - Communications of the Association for Computing Machinery 19:113-26.

View all 6 references / Add more references