Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
From MaRDI portal
Publication:2965484
DOI10.4230/LIPIcs.STACS.2014.199zbMath1360.91042arXiv1309.5439OpenAlexW2962750855MaRDI QIDQ2965484
Mickael Randour, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1309.5439
synthesisshortest pathMarkov decision processesquantitative objectivesmean-payoffworst-case and expected valuetwo-player games on graphs
2-person games (91A05) Games involving graphs (91A43) Markov and semi-Markov decision processes (90C40)
Related Items (9)
The Odds of Staying on Budget ⋮ Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Markov automata with multiple objectives ⋮ Percentile queries in multi-dimensional Markov decision processes ⋮ Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints ⋮ Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Unnamed Item ⋮ Looking at mean-payoff and total-payoff through windows
This page was built for publication: Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
