Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games

DOI10.1016/J.IC.2016.10.011zbMATH Open1371.91022OpenAlexW2555847713MaRDI QIDQ528191FDOQ528191

Authors: Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin 

Publication date: 12 May 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4458/

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

zbMATH Keywords

Markov decision processshortest pathbeyond worst-case synthesismean-payofftwo-player quantitative game on graphworst-case and expected value

Mathematics Subject Classification ID

2-person games (91A05) Markov and semi-Markov decision processes (90C40) Games involving graphs (91A43)

Cites Work

• The complexity of mean payoff games on graphs
• Title not available (Why is that?)
• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
• The complexity of probabilistic verification
• Title not available (Why is that?)
• Borel determinacy
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Analysis of Stochastic Shortest Path Problems
• A note on the complexity of cryptography (Corresp.)
• Positional strategies for mean payoff games
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Percentile performance criteria for limiting average Markov decision processes
• PP is as Hard as the Polynomial-Time Hierarchy
• Minimizing risk models in Markov decision processes with policies depending on target values
• On short paths interdiction problems: Total and node-wise limited interdiction
• Stochastic Games with Perfect Information and Time Average Payoff
• Trading performance for stability in Markov decision processes
• Mean-payoff games with partial-observation (extended abstract)
• Energy and mean-payoff games with imperfect information
• Hoeffding's inequality for uniformly ergodic Markov chains
• Faster algorithms for mean-payoff games
• Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
• On time with minimal expected cost!
• Games through Nested Fixpoints
• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2004
• Fast convergence to state-action frequency polytopes for MDPs
• The complexity of multi-mean-payoff and multi-energy games
• Looking at mean-payoff and total-payoff through windows
• Lower Bounds for Selection in X + Y and Other Multisets
• 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
• Variations on the stochastic shortest path problem
• Percentile queries in multi-dimensional Markov decision processes
• The complexity of the \(K\)th largest subset problem and related problems

Cited In (21)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• LTL reactive synthesis with a few hints
• Title not available (Why is that?)

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)