Sciweavers

201 search results - page 30 / 41
» Solving Concurrent Markov Decision Processes
Sort
View
AAAI
2006
15 years 1 months ago
Targeting Specific Distributions of Trajectories in MDPs
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
David L. Roberts, Mark J. Nelson, Charles Lee Isbe...
AAAI
2006
15 years 1 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
UAI
2004
15 years 1 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
NIPS
2003
15 years 1 months ago
An MDP-Based Approach to Online Mechanism Design
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
David C. Parkes, Satinder P. Singh
TRANSCI
2002
106views more  TRANSCI 2002»
14 years 11 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...