Finitely additive dynamic programming
Year of publication: |
February 2016
|
---|---|
Authors: | Sudderth, William D. |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 1, p. 92-108
|
Subject: | dynamic programming | Markov decision processes | finitely additive probability | Dynamische Optimierung | Dynamic programming | Theorie | Theory | Markov-Kette | Markov chain | Mathematische Optimierung | Mathematical programming | Entscheidung | Decision |
-
Optimal assignment of sellers in a store with a random number of clients via the Armed Bandit model
Vázquez-Guevara, Víctor Hugo, (2017)
-
On boundedness of Q-learning iterates for stochastic shortest path problems
Yu, Huizhen, (2013)
-
Improved and generalized upper bounds on the complexity of policy iteration
Scherrer, Bruno, (2016)
- More ...
-
Flesch, János, (2021)
-
Sudderth, William D., (2020)
-
Inflationary Equilibrium in a Stochastic Economy with Independent Agents
Geanakoplos, John, (2009)
- More ...