Sciweavers

COLT
2004
Springer
13 years 10 months ago
Reinforcement Learning for Average Reward Zero-Sum Games
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...
Shie Mannor
ICTAI
2005
IEEE
13 years 10 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet