Sciweavers

201 search results - page 25 / 41
» Solving Concurrent Markov Decision Processes
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
A dynamic relay selection scheme for mobile users in wireless relay networks
—Cooperative communication has attracted dramatic attention in the last few years due to its advantage in mitigating channel fading. Despite much effort that has been made in the...
Yifan Li, Ping Wang, Dusit Niyato, Weihua Zhuang
AAAI
2012
13 years 4 days ago
Kernel-Based Reinforcement Learning on Representative States
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
Branislav Kveton, Georgios Theocharous
CONCUR
2006
Springer
15 years 1 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger
WSC
2008
15 years 2 days ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi
IJCAI
2007
14 years 11 months ago
An Experts Algorithm for Transfer Learning
A long-lived agent continually faces new tasks in its environment. Such an agent may be able to use knowledge learned in solving earlier tasks to produce candidate policies for it...
Erik Talvitie, Satinder Singh