Simple strategies in multi-objective MDPs
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Markov and semi-Markov decision processes (90C40)
Recommendations
- Markov Decision Processes with Multiple Objectives
- Multi-Objective Model Checking of Markov Decision Processes
- Multi-objective Model Checking of Markov Decision Processes
- Markov Decision Processes with Multiple Long-Run Average Objectives
- Markov decision processes with multiple long-run average objectives
Cites work
- A survey of multi-objective sequential decision-making
- Ensuring the reliability of your model checker: interval iteration for Markov decision processes
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 6276214 (Why is no real title available?)
- Markov Decision Processes with Multiple Objectives
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Mixed-integer quadratic programming is in NP
- Multi-cost bounded reachability in MDP
- Multi-Objective Model Checking of Markov Decision Processes
- Multi-weighted Markov decision processes with reachability objectives
- Nondeterministic Polling Systems
- Pareto curves for probabilistic model checking
- Percentile queries in multi-dimensional Markov decision processes
- Quantitative multi-objective verification for probabilistic systems
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
- The 10,000 facets of MDP model checking
- Threshold constraints with guarantees for parity objectives in Markov decision processes
- Trade-off analysis meets probabilistic model checking
- Unifying two views on multiple mean-payoff objectives in Markov decision processes
- Variations on the stochastic shortest path problem
- Verifying team formation protocols with probabilistic model checking
Cited in
(19)- Multi-objective optimization of long-run average and total rewards
- Multi-cost bounded tradeoff analysis in MDP
- Multi-cost bounded reachability in MDP
- Multi-objective discounted reward verification in graphs and MDPs
- Multiple-environment Markov decision processes
- On Optimal Satisficing: How Simple Policies Can Achieve Excellent Results
- Games where you can play optimally with arena-independent finite memory
- scientific article; zbMATH DE number 7559480 (Why is no real title available?)
- Mixing probabilistic and non-probabilistic objectives in Markov decision processes
- Markov Decision Processes with Multiple Objectives
- Markov Decision Processes with Multiple Long-Run Average Objectives
- Stochastic games with lexicographic objectives
- Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
- Stochastic games with disjunctions of multiple objectives
- Computing expected visiting times and stationary distributions in Markov chains: fast and accurate
- Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
- An oracle-guided approach to constrained policy synthesis under uncertainty
- Simplicity lies in the eye of the beholder: a strategic perspective on controllers in reactive synthesis
- Positional-player games
This page was built for publication: Simple strategies in multi-objective MDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039517)
