Sciweavers

332 search results - page 29 / 67
» Ranking policies in discrete Markov decision processes
Sort
View
ICIS
2003
13 years 9 months ago
A Computational Approach to Compare Information Revelation Policies
Revelation policies in an e-marketplace differ in terms of the level of competitive information disseminated to participating sellers. Since sellers who repeatedly compete against...
Amy R. Greenwald, Karthik Kannan, Ramayya Krishnan
ATAL
2006
Springer
13 years 11 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
14 years 2 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
ISLPED
1999
ACM
91views Hardware» more  ISLPED 1999»
14 years 10 days ago
Stochastic modeling of a power-managed system: construction and optimization
-- The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing ce...
Qinru Qiu, Qing Wu, Massoud Pedram
JMLR
2010
125views more  JMLR 2010»
13 years 2 months ago
Variational methods for Reinforcement Learning
We consider reinforcement learning as solving a Markov decision process with unknown transition distribution. Based on interaction with the environment, an estimate of the transit...
Thomas Furmston, David Barber