Metareasoning and Bounded Rationality
Metareasoning and Bounded Rationality
This chapter explores the relationship between computational models of rational behavior and metareasoning. It examines several approaches to bounded rationality, dividing them into four broad classes: heuristic search, approximate modeling, optimal metareasoning, and bounded optimality. The approach based on optimal metareasoning seems particularly attractive because it is both relatively easy to implement and provides some formal guarantees about the behavior of the agent. The chapter considers several instantiations of this approach using anytime algorithms and provides a characterization of the relationship between the object-level and metareasoning components. These examples show that metareasoning plays an important role in this particular approach to bounded rationality.
Keywords: rational behavior, bounded rationality, heuristic search, approximate modeling, optimal metareasoning, bounded optimality
MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.
