Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives

DOI10.1145/2603088.2603096zbMath1401.91035arXiv1209.1007OpenAlexW2008487582MaRDI QIDQ4635664

Yaron Velner

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.1007

zbMATH Keywords

mean-payoff gamesquantitative synthesismultidimensional quantitative games on graphs

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Decidability (number-theoretic aspects) (11U05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Compositional strategy synthesis for stochastic games with multiple objectives

This page was built for publication: Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives