Sciweavers

682 search results - page 62 / 137
» One-Counter Markov Decision Processes
Sort
View
IJCAI
2001
15 years 5 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 3 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
AIPS
2003
15 years 5 months ago
Recommendation as a Stochastic Sequential Decision Problem
Recommender systems — systems that suggest to users in e-commerce sites items that might interest them — adopt a static view of the recommendation process and treat it as a pr...
Ronen I. Brafman, David Heckerman, Guy Shani
NIPS
2004
15 years 5 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky
STACS
2012
Springer
13 years 11 months ago
Stabilization of Branching Queueing Networks
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
Tomás Brázdil, Stefan Kiefer