Sciweavers

771 search results - page 10 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
WSC
2001
15 years 1 months ago
On improving the performance of simulation-based algorithms for average reward processes with application to network pricing
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
Enrique Campos-Náñez, Stephen D. Pat...
AIPS
2000
15 years 1 months ago
Representations of Decision-Theoretic Planning Tasks
Goal-directed Markov Decision Process models (GDMDPs) are good models for many decision-theoretic planning tasks. They have been used in conjunction with two different reward stru...
Sven Koenig, Yaxin Liu
AAMAS
2011
Springer
14 years 6 months ago
Optimizing coalition formation for tasks with dynamically evolving rewards and nondeterministic action effects
We consider a problem domain where coalitions of agents are formed in order to execute tasks. Each task is assigned at most one coalition of agents, and the coalition can be reorg...
Majid Ali Khan, Damla Turgut, Ladislau Böl&ou...