References

1

Eric B. Baum and Warren D. Smith. Best play for imperfect players and game tree search. Draft report, NEC Research Institute, 4 Independence Way, Princeton, NJ 08540, March 1993.

2

Ronald J. Bodkin. Extending computational game theory: Simultaneity, multiple agents, chance and metareasoning. Master's thesis, Massachusetts Institute of Technology, September 1992.

3

John S. Breese and Eric J. Horvitz. Reformulating and solving belief networks under bounded resources. Technical Report KSL-90-28, Knowledge Systems Laboratory, Stanford University, March 1990.

4

Hollis J. Call and William A. Miller. A comparison of approaches and implementations for automating decision analysis. Reliability Engineering and System Safety, 30:115-162, 1990.

5

Jim des Rivieres and Brian Cantwell Smith. The implementation of procedurally reflective languages. Technical Report CSLI-84-9, Center for the Study of Language and Information, Ventura Hall, Stanford University, Stanford, CA 94305, November 1984.

6

Michael Frank. The limits of bayesianism. Draft report, Laboratory for Computer Science, MIT, May 1992.

7

Bjorn Gamback, Manny Rayner, and Barney Pell. An architecture for a sophisticated mechanical bridge player. Draft report, Knowledge Based Systems Laboratory, Swedish Institute of Computer Science.

8

Matthew L. Ginsberg and Donald F. Geddis. Is there any need for domain-dependent control information? In Proceedings Ninth National Conference on Artificial Intelligence, 1991.

9

G. Anthony Gorry. Computer-assisted clinical decision making. Methods of Information in Medicine, 12:45-51, 1973.

10

G. Anthony Gorry, Jerome P. Kassirer, Alvin Essig, and William B. Schwartz. Decision analysis as the basis for computer-aided management of acute renal failure. The American Journal of Medicine, 55:473-484, October 1973.

11

Othar Hansson, Gerhard Holt, and Andrew Mayer. Experiments with a decision-theoretic scheduler. In Proceedings of the AAAI Spring Symposium on Practical Approaches to Planning, Scheduling and Control, Stanford, California, March 1992.

12

Othar Hansson and Andrew Mayer. The optimality of satisficing solutions. In Proceedings of the Fourth Workshop on Uncertainty in Artificial Intelligence, August 1988.

13

Othar Hansson and Andrew Mayer. Heuristic search as evidential reasoning. In Proceedings of the Fifth Workshop on Uncertainty in Artificial Intelligence, Windsor, Ontario, August 1989.

14

Othar Hansson and Andrew Mayer. Probabilistic heuristic estimates. Annals of Mathematics and Artificial Intelligence, 2:209-220, 1990.

15

Othar Hansson, Andrew Mayer, and Stuart Russell. Decision-theoretic planning in bps. In Proceedings of the AAAI Spring Symposium on Planning in Uncertain, Unpredictable, or Changing Environments, Stanford, California, March 1990.

16

David Heckerman and Holly Jimison. A perspective on confidence and its use in focusing attention during knowledge acquisition. In Proceedings of the Third Workshop on Uncertainty in Artificial Intelligence, pages 123-131, Seattle, WA, 1987.

17

David E. Heckerman, Eric J. Horvitz, and Bharat N. Nathwani. Toward effective normative decision systems: Update on the pathfinder project. Technical Report KSL-89-25, Knowledge Systems Laboratory, Stanford University, March 1989.

18

Eric J. Horvitz. Reasoning under varying and uncertain resource constraints. Technical Report KSL-88-35, Knowledge Systems Laboratory, Stanford University, April 1988.

19

Eric J. Horvitz. Rational metareasoning and compilation for optimizing decisions under bounded resources. Technical Report KSL-89-81, Knowledge Systems Laboratory, Stanford University, August 1990.

20

Eric J. Horvitz and John S. Breese. Ideal partition of resources for metareasoning. Technical Report KSL-90-26, Knowledge Systems Laboratory, Stanford University, March 1990.

21

Eric J. Horvitz, John S. Breese, and Max Henrion. Decision theory in expert systems and artificial intelligence. Technical Report KSL-88-13, Knowledge Systems Laboratory, Stanford University, February 1988.

22

Eric J. Horvitz, Gregory F. Cooper, and David E. Heckerman. Reflection and action under scarce resources: Theoretical principles and empirical study. Technical Report KSL-89-01, Knowledge Systems Laboratory, Stanford University, May 1989.

23

Eric J. Horvitz, H. Jacques Suermondt, and Gregory F. Cooper. Bounded conditioning: Flexible inference for decisions under scarce resources. Technical Report KSL-89-42, Knowledge Systems Laboratory, Stanford University, September 1990.

24

Donald E. Knuth and Ronald W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6:293-326, 1975.

25

Nicholas Kushmerick, Steve Hanks, and Daniel Weld. An algorithm for probabilistic planning. Draft Report, Department of Computer Science and Engineering, University of Washington, January 1993.

26

Tze-Yun Leong. Toward a general framework for automated dynamic decision making. Ph.D. thesis proposal, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, February 1993.

27

Monroe Newborn. Computer chess: Ten years of significant progress. Advances in Computers, 29:197-248, 1989.

28

Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley series in Artificial Intelligence. Addison-Wesley, 1984.

29

Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA, 1988.

30

Barney Pell. Metagame: A New Methodology for Games and Learning. PhD thesis, Trinity College, University of Cambridge, August 1992. Unpublished draft.

31

Barney Pell. Metagame in symmetric chess-like games. In H. J. van den Herik and L. V. Allis, editors, Heuristic Programming in Artificial Intelligence 3-The Third Computer Olympiad. Ellis Horwood, 1992.

32

Start Russell and Eric Wefald. Decision-theoretic control of reasoning: General theory and an application to game-playing. Draft report, Computer Science Division, University of California, Berkeley, CA 94270, October 1988.

33

Stuart Russell. Fine-grained decision-theoretic search control. In Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, 1990.

34

Stuart Russell and Eric Wefald. A meta-greedy game-playing algorithm. Draft report, Computer Science Division, University of California, Berkeley, CA 94720, March 1988.

35

Stuart Russell and Eric Wefald. On optimal game-tree search using rational meta-reasoning. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 334-340, 1989.

36

Stuart Russell and Eric Wefald. Principles of metareasoning. Artificial Intelligence, 49:361-395, 1991.

37

William B. Schwartz, G. Anthony Gorry, Jerome P. Kassirer, and Alvin Essig. Decision analysis and clinical judgement. The American Journal of Medicine, 55:459-472, October 1973.

38

David E. Smith. A decision-theoretic approach to the control of planning search. Technical Report LOGIC-87-11, Stanford Logic Group, Department of Computer Science, Stanford University, January 1988.

39

Michael P. Wellman. Formulation of tradeoffs in planning under uncertainty. Ph.D. Thesis MIT/LCS/TR-427, Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, Massachusetts 02139, August 1988.

40

Michael P. Wellman and Jon Doyle. Modular utility representation for decision-theoretic planning. In James Hendler, editor, Artificial Intelligence Planning Systems: Proceedings of the First International Conference, pages 236-242, June 1992.

41

Michael P. Wellman, Mark H. Eckman, Craig Fleming, Sharon L. Marchall, Frank A. Sonnenberg, and Stephen G. Pauker. Automated critiquing of medical decision trees. Medical Decision Making, 9:272-284, 1989.

42

John B. Wong, Frank A. Sonnenberg, Deeb N. Salem, and Stephen G. Pauker. Myocardial revascularization for chronic stable angina: Analysis of the role of percutaneous transluminal coronary angioplasty based on data available in 1989. Annals of Internal Medicine, 113(11):852-871, December 1990.