Sciweavers

5 search results - page 1 / 1
» Discounted deterministic Markov decision processes and disco...
Sort
View
TALG
2010
73views more  TALG 2010»
13 years 3 months ago
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
Omid Madani, Mikkel Thorup, Uri Zwick
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
13 years 10 months ago
Model Checking Discounted Temporal Properties
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
Luca de Alfaro, Marco Faella, Thomas A. Henzinger,...
FOCS
2003
IEEE
13 years 10 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
IJCAI
2007
13 years 6 months ago
Average-Reward Decentralized Markov Decision Processes
Formal analysis of decentralized decision making has become a thriving research area in recent years, producing a number of multi-agent extensions of Markov decision processes. Wh...
Marek Petrik, Shlomo Zilberstein
IJCAI
2001
13 years 6 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen