Sciweavers

337 search results - page 66 / 68
» Mean-Variance Optimization in Markov Decision Processes
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Exploiting belief bounds: practical POMDPs for personal assistant agents
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
Pradeep Varakantham, Rajiv T. Maheswaran, Milind T...
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 9 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
AAAI
2006
13 years 9 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 28 days ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
TCOM
2011
130views more  TCOM 2011»
13 years 2 months ago
Indirect Reciprocity Game Modelling for Cooperation Stimulation in Cognitive Networks
—In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their...
Yan Chen, K. J. Ray Liu