Constraint-based optimization with the minimax decision criterion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 168-182

  Boutilier, Craig ^a   Patrascu, Relu ^b   Poupart, Pascal ^a   Schuurmans, Dale ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CONSTRAINT-BASED; DECISION CRITERIONS; FEASIBLE SOLUTION; GENERALIZED ADDITIVES; HARD CONSTRAINTS; MINIMAX REGRET; MIXED INTEGER LINEAR PROGRAM; UTILITY FUNCTIONS;

INTEGER PROGRAMMING;

EID: 33750723292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_12     Document Type: Article

References (18)

1. F. Bacchus and A. Grove. Graphical models for preference and utility. In Proc. 11th Conf. on Uncertainty in AI, pp.3-10, Montreal, 1995.
2. U. Bertele and F. Brioschi. Nonserial Dynamic Programming. Academic, Orlando, 1972.
3. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201-236, 1997.
4. C. Boutilier. A POMDP formulation of preference elicitation problems. In Proc. 18th National Conf. on AI, pp.239-246, Edmonton, 2002.
5. C. Boutilier, F. Bacchus, and R. I. Brafman. UCP-Networks: A directed graphical representation of conditional utilities. In Proc. 17th Conf. on Uncertainty in AI, pp.56-64, 2001.
6. U. Chajewska, L. Getoor, J. Norman, and Y. Shahar. Utility elicitation as a classification problem. In Proc. 14th Conf. on Uncertainty in AI, pp.79-88, Madison, WI, 1998.
7. U. Chajewska, D. Koller, and R. Parr. Making rational decisions using adaptive utility elicitation. In Proc. 17th National Conf. on AI, pp.363-369, Austin, TX, 2000.
8. V. Chandru and J. Hooker. Optimization Methods for Logical Inference. Wiley, N.Y., 1999.
9. R. Dechter. Bucket elimination: A unifying framework for probabilistic inference. In Proc. Twelfth Conf. on Uncertainty in AI, pp.211-219, Portland, OR, 1996.
10. J. S. Dyer. Interactive goal programming. Management Science, 19:62-70, 1972.
11. S. French. Decision Theory. Halsted Press, New York, 1986.
12. C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In Proc. 17th Intl. Joint Conf. on AI, pp.673-680, Seattle, 2001.
13. R. L. Keeney and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Trade-offs. Wiley, New York, 1976.
14. D. Sabin and R. Weigel. Product configuration frameworks - a survey. IEEE Intelligent Systems and their Applications, 13(4):42-49, 1998.
15. T. Schiex, H. Fargie, and G. Verfaillie. Valued constraint satisfaction problems: Hard and easy problems. In Proc. 14th Intl. Joint Conf. on AI, pp.631-637, Montreal, 1995.
16. T. Wang and C. Boutilier. Incremental utility elicitation with the minimax regret decision criterion. In Proc. 18th Intl. Joint Conf. on AI, to appear, Acapulco, Mexico, 2003.
17. C. C. White, III, A. P. Sage, and S. Dozono. A model of multiattribute decision making and trade-off weight determination under uncertainty. IEEE Transactions on Systems, Man and Cybernetics, 14(2):223-229, 1984.
18. D. Schuurmans, R. Patrascu. Direct value-approximation for factored MDPs. In Advances in Neural Information Processing 14, pp. 1579-1586, MIT Press, Cambridge, MA, 2002.