Derman's book as inspiration: some results on LP for MDPs
From MaRDI portal
Publication:378728
DOI10.1007/s10479-011-1047-4zbMath1306.90167MaRDI QIDQ378728
Publication date: 12 November 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-1047-4
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Communicating MDPs: Equivalence and LP properties
- Separable Markovian decision problems. The linear programming method in the multichain case
- NP-hardness of checking the unichain condition in average cost MDPs
- Finite state Markovian decision processes
- Linear Programming and Sequential Decisions
- On Sequential Decisions and Markov Chains
- An $O(N^3 )$ Algorithm for Optimal Replacement Problems
- Extensions of the multiarmed bandit problem: The discounted case
- Linear Programming for Finite State Multi-Armed Bandit Problems
- Constrained Undiscounted Stochastic Dynamic Programming
- A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index
- The Multi-Armed Bandit Problem: Decomposition and Computation
- Linear Programming and Markov Decision Chains
- Survey of linear programming for standard and nonstandard Markovian control problems. Part II: Applications
- Programming with linear fractional functionals
- Algorithmic Equivalence in Linear Fractional Programming
- On Linear Programming in a Markov Decision Problem
- Multichain Markov Renewal Programs
- Linear Programming Solutions for Separable Markovian Decision Problems
- Separable Markovian Decision Problems
