Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives

DOI10.1145/2933575.2934513zbMath1401.68238arXiv1604.06376OpenAlexW2341066496MaRDI QIDQ4635880

Laurent Doyen, Krishnendu Chatterjee

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Markov decision processesstochastic gamesmean-payoff

Mathematics Subject Classification ID

Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Submixing and shift-invariant stochastic games ⋮ Unnamed Item ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ Multi-objective optimization of long-run average and total rewards ⋮ Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations

This page was built for publication: Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives