Algebraic Markov decision processes

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1372-1377

  Perny, Patrice ^a   Spanjaard, Olivier ^a   Weng, Paul ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC APPROACHES; ALGEBRAIC PATH PROBLEM; BELLMAN EQUATIONS; EXPECTED UTILITY; MARKOV DECISION PROCESSES; OPTIMAL POLICIES; PARTIAL PREFERENCES; PLAUSIBILITY MEASURES;

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES;

ALGEBRA;

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

References (24)

1. S. Bistarelli, U. Montanari, and F. Rossi. Constraint solving over semirings. In Proc. of IJCAI, 1995.
2. B. Bonet and J. Pearl. Qualitative MDPs and POMDPs: An order-of-magnitude approximation. In Proc. of the 18th UAI, pages 61-68, 2002.
3. F.C. Chu and J.Y. Halpern. Great expectations. part I: On the customizability of generalized expected utility. In Proc. of the 18th IJCAI, pages 291-296, 2003.
4. F.C. Chu and J.Y. Halpern. Great expectations. part II: Generalized expected utility as a universal decision rule. In Proc. of the 18th IJCAI, pages 297-302, 2003.
5. A. Darwiche and M.L. Ginsberg. A symbolic generalization of probability theory. In Proc. of the 10th AAAI, pages 622-627, 1992.
6. T. Dean, L.P. Kaelbling, J. Kirman, and A. Nicholson. Planning with deadlines in stochastic domains. In Proc. of the 11th AAAI, pages 574-579, 1993.
7. D. Dubois and H. Prade. Possibility theory as a basis of qualitative decision theory. In Proc. of the 14th IJCAI, pages 1925-1930, 1995.
8. N. Friedman and J. Halpern. Plausibility measures: A user's guide. In Proc. of the 11th UAI, pages 175-184, 1995.
9. P.H. Giang and P.P. Shenoy. A comparison of axiomatic approaches to qualitative decision making using possibility theory. In Proc. of the 17th UAI, pages 162-170, 2001.
10. B. Grosof. Generalizing prioritization. In Proc. of the 2nd KR, pages 289-300, 1991.
11. U. Junker. Preference-based search and multicriteria optimization. In Proc. of AAAI, pages 34-40, 2002.
12. L.P. Kaebling, M. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1999. (Pubitemid 128387390)
13. M.L. Littman and C. Szepesvári. A generalized reinforcement- learning model: Convergence and applications. In Proc. of the 13th ICML, pages 310-318, 1996.
14. R.D. Luce. Increasing increment generalizations of rank-dependent theories. Theory and Decision, 55:87-146, 2003.
15. M.J. Machina. Dynamic consistency and non-expected utility models of choice under uncertainty. Journal of Economic Literature, 27:1622-1668, 1989.
16. M. Minoux. Generalized path algebra. In Surveys of Mathematical Programming, pages 359-364. Publishing House of the Hungarian Academy of Sciences, 1977.
17. J. von Neumann and O. Morgenstern. Theory of games and economic behavior. 2nd Ed. Princeton University Press, 1947.
18. M.L. Puterman. Markov Decision Processes - Discrete Stochastic Dynamic Programming. Wiley & Sons, 1994.
19. J. Quiggin. Generalized expected utility theory: the rank-dependant model. Kluwer Academic Publishers, 1993.
20. R. Sabbadin. A possibilistic model for qualitative sequential decision problems under uncertainty in partially observable environments. In Proc. of UAI, pages 567-574, 1999.
21. R. Sarin and P. Wakker. Dynamic choice and non-EU. J. of Risk and Uncertainty, 17:87-119, 1998.
22. L.J. Savage. The Foundations of Statistics. J. Wiley & Sons, 1954.
23. K. Wakuta. Vector-valued markov decision processes and the systems of linear inequalities. Stochastic Processes and their Applications, 56:159-169, 1995.
24. N. Wilson. An order of magnitude calculus. In Proc. of the 11th UAI, pages 548-555, 1995.