Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
type: Item
instance of: scholarly article
title: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
zbMATH Open document ID: 1371.91022
author: Véronique Bruyère
author: Emmanuel Filiot
author: Mickael Randour
author: Jean-François Raskin
published in: Information and Computation
publication date: 2017-05-12T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4458/
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 6714837
zbMATH Keywords: two-player quantitative game on graph
zbMATH Keywords: Markov decision process
zbMATH Keywords: beyond worst-case synthesis
zbMATH Keywords: worst-case and expected value
zbMATH Keywords: mean-payoff
zbMATH Keywords: shortest path
MaRDI profile type: Publication
OpenAlex ID: W2555847713
cites work: Positional strategies for mean payoff games
cites work: The complexity of mean payoff games on graphs
cites work: Faster algorithms for mean-payoff games
cites work: Q4315289
cites work: Stochastic Games with Perfect Information and Time Average Payoff
cites work: Q4382287
cites work: An Analysis of Stochastic Shortest Path Problems
cites work: Q4270052
cites work: Looking at mean-payoff and total-payoff through windows
cites work: The complexity of the \(K\)th largest subset problem and related problems
cites work: Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
cites work: Q4994885
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: Minimizing risk models in Markov decision processes with policies depending on target values
cites work: Percentile performance criteria for limiting average Markov decision processes
cites work: Percentile queries in multi-dimensional Markov decision processes
cites work: Trading Performance for Stability in Markov Decision Processes
cites work: Variations on the Stochastic Shortest Path Problem
cites work: Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives
cites work: Q5322945
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: Games through Nested Fixpoints
cites work: Mathematical Foundations of Computer Science 2004
cites work: The complexity of probabilistic verification
cites work: Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
cites work: Fast convergence to state-action frequency polytopes for MDPs
cites work: Hoeffding's inequality for uniformly ergodic Markov chains
cites work: Q4393471
cites work: Borel determinacy
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: A note on the complexity of cryptography (Corresp.)
cites work: Q4198056
cites work: PP is as Hard as the Polynomial-Time Hierarchy
cites work: Lower Bounds for Selection in X + Y and Other Multisets
cites work: The complexity of multi-mean-payoff and multi-energy games
cites work: Strategy synthesis for multi-dimensional quantitative objectives
cites work: Energy and Mean-Payoff Games with Imperfect Information
cites work: Mean-Payoff Games with Partial-Observation
cites work: On Time with Minimal Expected Cost!
DOI: 10.1016/J.IC.2016.10.011
description: scientific article; zbMATH DE number 6714837