Sciweavers

23 search results - page 4 / 5
» A Fast Analytical Algorithm for Solving Markov Decision Proc...
Sort
View
ATAL
2007
Springer
14 years 3 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...
UAI
2004
13 years 10 months ago
Region-Based Incremental Pruning for POMDPs
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
Zhengzhu Feng, Shlomo Zilberstein
HYBRID
2010
Springer
14 years 4 months ago
On a control algorithm for time-varying processor availability
We consider an anytime control algorithm for the situation when the processor resource availability is time-varying. The basic idea is to calculate the components of the control i...
Vijay Gupta
WECWIS
2005
IEEE
141views ECommerce» more  WECWIS 2005»
14 years 2 months ago
An Adaptive Bilateral Negotiation Model for E-Commerce Settings
This paper studies adaptive bilateral negotiation between software agents in e-commerce environments. Specifically, we assume that the agents are self-interested, the environment...
Vidya Narayanan, Nicholas R. Jennings
ICML
2003
IEEE
14 years 10 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum