Definition and complexity of some basic metareasoning problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1099-1106

  Conitzer, Vincent ^a   Sandholm, Tuomas ^a  

^a Computer Science Department ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANY-TIME ALGORITHMS; DECISION-THEORETIC METHODS; HARDNESS RESULT; INFORMATION GATHERING; METAREASONING; PROBLEM INSTANCES; REAL-WORLD;

ARTIFICIAL INTELLIGENCE;

EID: 26644463506     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Eric B Baum and Warren D Smith. A Bayesian approach to relevance in game playing. Artificial Intelligence, 97(1 -2): 195-242, 1997.
2. Mark Boddy and Thomas Dean. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence, 67:245-285, 1994.
3. Irving Good. Twenty-seven principles of rationality. In V Godambe and D Sprott, eds, Foundations of Statistical Inference. Toronto: Holt, Rinehart, Winston, 197).
4. E Hansen and S Zilbcrstein. Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence, 126:139-157,2001. (Pubitemid 32196234)
5. Eric Horvitz. Principles and applications of continual computation. Artificial Intelligence, 126:159-196, 2001.
6. Eric J. Horvitz. Reasoning about beliefs and actions under computational resource constraints. Workshop on Uncertainty in AI, pp. 429-444, Seattle, Washington, 1987. American Assoc, for AI.
7. Also in L. Kanal, T. Levitt, and J. Lemmer, eds, Uncertainty in AI 3, Elsevier, 1989, pp. 301-324.
8. Ronald Howard. Information value theory. IEEE Transactions on Systems Science and Cybernetics, 2(1):22-26, 1966.
9. Kate Larson and Tuomas Sandholm. Bargaining with limited computation: Deliberation equilibrium. Artificial Intelligence, 132(2): 183-217, 2001.
10. Early version: AAAI, pp. 48-55, Austin, TX, 2000.
11. Kate Larson and Tuomas Sandholm. Costly valuation computation in auctions. Theoretical Aspects of Rationality and Knowledge (TARK), pp. 169-182, 2001.
12. James E Matheson. The economic value of analysis and computation. IEEE Transactions on Systems Science and Cybernetics, 4(3):325-332, 1968.
13. J C Papadimitriou. Games against nature. Journal of Computer and System Sciences, 31:288-301, 1985.
14. David Parkes and Lloyd Greenwald. Approximate and compensate: A method for risk-sensitive meta-deliberation and continual computation. In AAAI Fall Symposium on Using Uncertainty within Computation, 2001.
15. S Russell and D Subramanian. Provably bounded-optimal agents. Journal of Artificial Intelligence Research, 1:1-36, 1995.
16. S Russell and E Wefald. Do the right thing: Studies in Limited Rationality. 1991.
17. Tuomas Sandholm and Victor Lesser. Utility-based termination of anytime algorithms. ECAI Workshop on Decision Theory for DAI Applications, pp. 88-99, Amsterdam, 1994. Extended version: UMass CS tech report 94-54.
18. Tuomas Sandholm and Victor Lesser. Coalitions among computationally bounded agents. Artificial Intelligence, 94:99-137, 1997. Early version: IJCAI-95,662-669.
19. Herbert A Simon. Models of bounded rationality, volume 2. MIT Press, 1982.
20. Shlomo Zilberstein, Francois Charpillet, and Philippe Chassaing. Real-time problem solving with contract algorithms. IJCAI, pp. 1008-1013, 1999.
21. Shlomo Zilbcrstein and Abdel-Illah Mouaddib. Reactive control of dynamic progressive processing. IJCAI, pp. 1268-1273, 1999.
22. Shlomo Zilberstein and Stuart Russell. Optimal composition of real-time systems. Artificial Intelligence, 82(1-2):181-213, 1996.