31 search results - page 2 / 7 » Sampled fictitious play for approximate dynamic programming |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
ATAL
2005
Springer
13 years 10 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
A dynamic model of a multiagent system defines a probability distribution over possible system behaviors over time. Alternative representations for such models present tradeoffs i...
SAGA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming ...