A POMDP formulation of preference elicitation problems

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 239-246

  Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; DECISION MAKING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; STRATEGIC PLANNING;

INTELLIGENT SYSTEMS;

DECISION SUPPORT SYSTEMS;

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

References (15)

1. Dimitri P. Bertsekas. Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, Englewood Cliffs, 1987.
2. Christopher M. Bishop. Neural Networks for Pattern Recognition. Clarendon, Oxford, 1995.
3. Craig Boutilier. On the foundations of expected expected utility. (manuscript), 2001.
4. Craig Boutilier, Fahiem Bacchus, and Ronen I. Brafman. UCP-Networks: A directed graphical representation of conditional utilities. In Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, pages 56-64, Seattle, 2001.
5. U. Chajewska, L. Getoor, J. Norman, and Y. Shahar. Utility elicitation as a classification problem. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pages 79-88, Madison, WI, 1998.
6. Urszula Chajewska, Daphne Koller, and Ronald Parr. Making rational decisions using adaptive utility elicitation. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 363-369, Austin, TX, 2000.
7. Hsien-Te Cheng. Algorithms for Partially Observable Markov Decision Processes. PhD thesis, University of British Columbia, Vancouver, 1988.
8. Simon French. Decision Theory. Halsted Press, New York, 1986.
9. Eric A. Hansen. Solving POMDPs by searching in policy space. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pages 211-219, Madison, WI, 1998.
10. Milos Hauskrecht. Value-function approximations for partially observable Markov decision processes. Journal of Artificial Intelligence Research, pages 33-94, 2000.
11. R. L. Keeney and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Trade-offs. Wiley, New York, 1976.
12. Long-Ji Lin and Tom. M. Mitchell. Memory approaches to reinforcement learning in non-Markovian domains. Technical Report CS-92-138, Carnegie Mellon University, Department of Computer Science, May 1992.
13. Ronald Parr and Stuart Russell. Approximating optimal policies for partially observable stochastic domains. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1088-1094, Montreal, 1995.
14. Richard D. Smallwood and Edward J. Sondik. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21:1071-1088, 1973.
15. Sebastian Thrun. Monte Carlo POMDPs. In Proceedings of Conference on Neural Information Processing Systems, pages 1064-1070, Denver, 1999.