Concurrent MDPs with Finite Markovian Policies
DOI10.1007/978-3-030-43024-5_3zbMath1484.68032OpenAlexW3010956653MaRDI QIDQ5014502
Dimitri Scheftelowitsch, Peter Buchholz
Publication date: 8 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-43024-5_3
integer linear programmingrobust optimizationoptimal policieslocal search heuristicsconcurrent Markov decision processes
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Computation of weighted sums of rewards for concurrent MDPs
- Light robustness in the optimization of Markov decision processes with uncertain parameters
- Robust MDPs with k-Rectangular Uncertainty
- Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- The Price of Robustness
- 50 Years of Integer Programming 1958-2008
- Updating the Inverse of a Matrix
- Markov Decision Processes with Imprecise Transition Probabilities
- Markovian Decision Processes with Uncertain Transition Probabilities
- Robust Markov Decision Processes
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Robust Dynamic Programming
- Robust Product Line Design
