Stochastic games with lexicographic objectives
From MaRDI portal
(Redirected from Publication:6632196)
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A survey of stochastic -regular games
- Approximating values of generalized-reachability stochastic games
- Attracting tangles to solve parity games
- Better Quality in Synthesis through Quantitative Objectives
- Decidability results for multi-objective stochastic games
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
- Games where you can play optimally with arena-independent finite memory
- scientific article; zbMATH DE number 1348599 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 1500643 (Why is no real title available?)
- scientific article; zbMATH DE number 1392310 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Lexicographic Probabilities and Choice Under Uncertainty
- LTL to deterministic Emerson-Lei automata
- Markov decision processes with multiple long-run average objectives
- Markov Decision Processes with Multiple Long-Run Average Objectives
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Mixing probabilistic and non-probabilistic objectives in Markov decision processes
- Model and objective separation with conditional lower bounds: disjunction is harder than conjunction
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives
- Multi-cost bounded tradeoff analysis in MDP
- Multi-Objective Decision Making
- Multi-objective discounted reward verification in graphs and MDPs
- Multi-Objective Model Checking of Markov Decision Processes
- Multi-objective optimization of long-run average and total rewards
- On stochastic games with multiple objectives
- Optimal cost almost-sure reachability in POMDPs
- Parameterized complexity of games with monotonically ordered \(\omega\)-regular objectives
- Pareto curves for probabilistic model checking
- Percentile performance criteria for limiting average Markov decision processes
- Percentile queries in multi-dimensional Markov decision processes
- Perfect half space games
- Perfect-information stochastic games with generalized mean-payoff objectives
- POMDPs under probabilistic semantics
- Probabilistic mobile ambients
- Quantitative multi-objective verification for probabilistic systems
- Quantitative verification and strategy synthesis for stochastic games
- Simple strategies in multi-objective MDPs
- Stochastic games with disjunctions of multiple objectives
- Stochastic games with lexicographic reachability-safety objectives
- Strategy synthesis for stochastic games with multiple long-run objectives
- The complexity of stochastic games
- Trading performance for stability in Markov decision processes
- Unifying two views on multiple mean-payoff objectives in Markov decision processes
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
Cited in
(1)
This page was built for publication: Stochastic games with lexicographic objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632196)
