Vincent Conitzer, Tuomas Sandholm  Home/Search
Context
Related
| cmu.edu/~sandholm/...soning.ijcai03.pdf cmu.edu/~conitzer/...asoningIJCAI03.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~sandholm/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to the metareasoning problem of selecting such actions. Decision-theoretic methods for metareasoning have been studied in AI, but there are few theoretical results on the complexity of metareasoning. We derive hardness results for three settings which most real metareasoning systems would have to encompass as... (Update)
Similar documents (at the sentence level):
78.8%: Definition and Complexity of Some Basic Metareasoning Problems - Conitzer, Sandholm (2002) (Correct)
Active bibliography (related documents): More All
0.4: Using Performance Profile Trees to Improve Deliberation Control - Larson, Sandholm (2004) (Correct)
0.4: Bargaining with Limited Computation: Deliberation Equilibrium - Larson, Sandholm (2000) (Correct)
0.4: Terminating Decision Algorithms Optimally - Sandholm (Correct)
Similar documents based on text: More All
0.4: Computational Criticisms of the Revelation Principle - Conitzer, Sandholm (2003) (Correct)
0.4: Complexity Results about Nash Equilibria - Conitzer, Sandholm (2002) (Correct)
0.4: Combinatorial Auctions with Structured Item Graphs - Vincent Conitzer And (2004) (Correct)
BibTeX entry: (Update)
@misc{ conitzer-definition,
author = "Vincent Conitzer and Tuomas Sandholm",
title = "Definition and Complexity of Some Basic Metareasoning Problems",
url = "citeseer.ist.psu.edu/article/conitzer03definition.html" }
Citations (may not include all citations):137 Do the right thing: Studies in Limited Rationality (context) - Russell, Wefald - 1991
93 Reasoning about beliefs and actions under computational reso.. - Horvitz - 1987
89 Deliberation scheduling for problem solving in time-constrai.. (context) - Boddy, Dean - 1994
82 Optimal composition of real-time systems - Zilberstein, Russell - 1996
77 Provably boundedoptimal agents - Russell, Subramanian - 1995
58 Games against nature (context) - Papadimitriou - 1985
54 Coalitions among computationally bounded agents - Sandholm, Lesser - 1997
35 IEEE Transactions on Systems Science and Cybernetics (context) - Howard, theory - 1966
30 Twenty-seven principles of rationality (context) - Good - 1971
19 A Bayesian approach to relevance in game playing - Baum, Smith - 1997
19 Bargaining with limited computation: Deliberation equilibriu.. - Larson, Sandholm - 2001
16 Principles and applications of continual computation - Horvitz - 2001
14 Real-time problem solving with contract algorithms - Zilberstein, Charpillet et al. - 1999
14 Monitoring and control of anytime algorithms: A dynamic prog.. - Hansen, Zilberstein - 2001
12 Utility-based termination of anytime algorithms (context) - Sandholm, Lesser - 1994
12 Models of bounded rationality (context) - Simon - 1982
8 Reactive control of dynamic progressive processing - Zilberstein, Mouaddib - 1999
7 IEEE Transactions on Systems Science and Cybernetics (context) - Matheson, value et al. - 1968
1 Theoretical Aspects of Rationality and Knowledge (context) - Larson, Sandholm et al. - 2001
Documents on the same site (http://www-2.cs.cmu.edu/~sandholm/): More
Miscomputing Ratio: The Social Cost of Selfish Computing - Larson, Sandholm (2003) (Correct)
Complexity of Determining Nonemptiness of the Core - Conitzer, Sandholm (2002) (Correct)
Definition and Complexity of Some Basic Metareasoning Problems - Conitzer, Sandholm (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC