Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
From MaRDI portal
(Redirected from Publication:528191)
Recommendations
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- Expectations or guarantees? I want it all! A crossroad between games and MDPs
- Threshold constraints with guarantees for parity objectives in Markov decision processes
- Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
- Perfect-information stochastic games with generalized mean-payoff objectives
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1361118 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 1161555 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A note on the complexity of cryptography (Corresp.)
- An Analysis of Stochastic Shortest Path Problems
- Borel determinacy
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Energy and mean-payoff games with imperfect information
- Expectations or guarantees? I want it all! A crossroad between games and MDPs
- Fast convergence to state-action frequency polytopes for MDPs
- Faster algorithms for mean-payoff games
- Games through Nested Fixpoints
- Hoeffding's inequality for uniformly ergodic Markov chains
- Looking at mean-payoff and total-payoff through windows
- Lower Bounds for Selection in X + Y and Other Multisets
- Mathematical Foundations of Computer Science 2004
- Mean-payoff games with partial-observation (extended abstract)
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- Minimizing risk models in Markov decision processes with policies depending on target values
- Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
- On short paths interdiction problems: Total and node-wise limited interdiction
- On time with minimal expected cost!
- PP is as Hard as the Polynomial-Time Hierarchy
- Percentile performance criteria for limiting average Markov decision processes
- Percentile queries in multi-dimensional Markov decision processes
- Positional strategies for mean payoff games
- Probability Inequalities for Sums of Bounded Random Variables
- Stochastic Games with Perfect Information and Time Average Payoff
- The complexity of mean payoff games on graphs
- The complexity of multi-mean-payoff and multi-energy games
- The complexity of probabilistic verification
- The complexity of the Kth largest subset problem and related problems
- Trading performance for stability in Markov decision processes
- Variations on the stochastic shortest path problem
Cited in
(21)- scientific article; zbMATH DE number 7447730 (Why is no real title available?)
- scientific article; zbMATH DE number 7649916 (Why is no real title available?)
- Optimal strategies in weighted limit games
- Threshold constraints with guarantees for parity objectives in Markov decision processes
- Life is random, time is not: Markov decision processes with window objectives
- Timed games with bounded window parity objectives
- Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
- Expectations or guarantees? I want it all! A crossroad between games and MDPs
- Combinations of Qualitative Winning for Stochastic Parity Games
- scientific article; zbMATH DE number 7447747 (Why is no real title available?)
- Quantitative reductions and vertex-ranked infinite games
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- On satisficing in quantitative games
- Simple strategies in multi-objective MDPs
- Synthesis for multi-weighted games with branching-time winning conditions
- Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis
- Stochastic games with lexicographic objectives
- Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
- QUASY: quantitative synthesis tool
- scientific article; zbMATH DE number 7559480 (Why is no real title available?)
- LTL reactive synthesis with a few hints
This page was built for publication: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528191)
