Dynamic preferences in multi-criteria reinforcement

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 601-608

  Natarajan, Sriraam ^a   Tadepalli, Prasad ^a  

^a OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; TIME VARYING SYSTEMS; VECTORS;

MULTI-CRITERIA REINFORCEMENT; NUMERIC WEIGHTS; SCALAR REWARDS; TIME-VARYING PREFERENCES;

LEARNING SYSTEMS;

EID: 31844444500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102351.1102427     Document Type: Conference Paper

References (21)

1. Abbeel, P., & Ng, A. (2004). Apprenticeship learning via inverse reinforcement learning. In Proceedings of ICML-04.
2. Altman, E. (1999). Constrained markov decision processes. Chapman and Hall. First edition.
3. Boutilier, C. (2002). A POMDP formulation of preference elicitation problems. In Proceedings AAAI-02.
4. Chajewska, U., Koller, D., & Ormoneit, D. (2001). Learning an agent's utility function by observing behavior. In Proceedings of ICML-01.
5. Feinberg, E., & Schwartz, A. (1995). Constrained markov decision models with weighted discounted rewards. Mathematics of Operations Research, 20, 302-320.
6. Gabor, Z., Kalmar, Z., & Szepesvari, C. (1998). Multicriteria reinforcement learning. In Proceedings of ICML-98.
7. Guestrin, C., Koller, D., & Parr, R. (2001). Multiagent planning with factored MDPs. In Proceedings NIPS-01.
8. Kaelbling, L. P., Littman, M., & Cassandra, A. (1998). Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101.
9. Kurose, J. F., & Ross, K. W. (2003). Computer networking - a top-down approach featuring the internet. Pearson Education. Second edition.
10. Lu, Y., Wang, W., Zhong, Y., & Bhargava, B. (2003). Study of distance vector routing protocols for mobile ad hoc networks. In Proceedings of PerCom-03.
11. Mahadevan, S. (1996). Average reward reinforcement learning: Foundations, algorithms, and empirical results. Machine Learning, 22, 159-195.
12. Mannor, S., & Shimkin, N. (2004). A geometric approach to multi-criterion reinforcement learning. JMLR, 5, 325-360.
13. Ng, A. Y., & Russell, S. (2000). Algorithms for inverse reinforcement learning. In Proceedings of ICML-00.
14. Parr, R. (1998). Flexible decomposition algorithms for weakly coupled markov decision problems. In Proceedings UAI-98.
15. Puterman, M. L. (1994). Markov decision processes. J.Wiley and Sons.
16. Russell, S., & Zimdars, A. L. (2003). Q-decomposition for reinforcement learning agents. In Proceedings of ICML-03.
17. Schwartz, A. (1993). A reinforcement learning method for maximizing undiscounted rewards. In Proceedings of ICML-93.
18. Stone, P. (2000). TPOT-RL applied to network routing. In Proceedings of ICML-00.
19. Tadepalli, P., & Ok, D. (1998). Model-based average reward reinforcement learning. AI Journal, 100, 177-223.
20. Tao, N., Baxter, J., & Weaver, L. (2001). A multi-agent policy-gradient approach to network routing. In Proceedings of ICML-01.
21. White, D. (1982). Multi-objecticve infinite-horizon discounted markov decision processes. Journal of Mathematical Analysis and Applications, 89, 639-647.