Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives
From MaRDI portal
Publication:4635809
DOI10.1109/LICS.2015.33zbMath1401.68117arXiv1504.08211OpenAlexW1495766446MaRDI QIDQ4635809
Lorenzo Clemente, Jean-François Raskin
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.08211
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Markov and semi-Markov decision processes (90C40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Extending finite-memory determinacy to multi-player games ⋮ Unnamed Item ⋮ Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Unnamed Item
This page was built for publication: Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives