Skip to main content

On Optimal Satisficing: How Simple Policies Can Achieve Excellent Results

  • Chapter

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 21))

Herbert Simon introduced the notion of satisficing to explain how boundedly rational agents might approach difficult sequential decision problems. His satisficing decision makers were offered as an alternative to optimizers, who need impressive computational capacities in order to maximize their payoffs. In this chapter, we present a simplified sequential search problem for a satisficing decision maker, and show how to compute its optimal satisficing search policies. Our analyses provide bounds on the performance of satisficing search policies.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. A. Akerlof. Irving Fisher on his head: The consequences of constant threshold-target monitoring of money holdings. The Quarterly Journal of Economics, 93:169–187, 1979.

    Article  Google Scholar 

  2. J. N. Bearden and T. Connolly. Multiattribute sequential search. Organizational Behavior & Human Decision Processes, 103:147–158, 2007.

    Article  Google Scholar 

  3. R. Bellman. Dynamic Programming. Princeton University Press, Princeton, NJ, 1957.

    Google Scholar 

  4. G. Gallego and G. van Ryzin. Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Science, 40:999–1020, 1994.

    Article  MATH  Google Scholar 

  5. G. Gigerenzer, P. M. Todd, and The ABC Research Group. Simple Heuristics That Make Us Smart. Oxford University Press, New York, 1999.

    Google Scholar 

  6. J. Gilbert and F. Mosteller. Recognizing the maximum of a sequence. Journal of the American Statistical Association, 61:35–73, 1966.

    Article  MathSciNet  Google Scholar 

  7. D. V. Lindley. Dynamic programming and decision theory. Applied Statistics, 10:39–51, 1961.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. B. MacQueen and R. G. Miller. Optimal persistance policies. Operations Research, 8:362–380, 1960.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. A. Simon. A behavioral model of rational choice. Quarterly Journal of Economics, 69:99–118, 1955.

    Article  Google Scholar 

  10. H. A. Simon. Satisficing. In D. Greenwald, editor, The McGraw-Hill Encyclopedia of Economics, pages 881–886. McGraw-Hill, New York, second edition, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Bearden, J.N., Connolly, T. (2008). On Optimal Satisficing: How Simple Policies Can Achieve Excellent Results. In: Kugler, T., Smith, J.C., Connolly, T., Son, YJ. (eds) Decision Modeling and Behavior in Complex and Uncertain Environments. Springer Optimization and Its Applications, vol 21. Springer, New York, NY. https://doi.org/10.1007/978-0-387-77131-1_4

Download citation

Publish with us

Policies and ethics