Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1174048,
author = {Chen, Taolue and Forejt, Vojtěch and Kwiatkowska, Marta and Simaitis, Aistis and Wiltsche, Clemens},
address = {Berlin, Heidelberg},
booktitle = {Proc. 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13)},
doi = {http://dx.doi.org/10.1007/978-3-642-40313-2_25},
editor = {Krishnendu Chatterjee and Jiri Sgall},
keywords = {multi-objective verification; stochastic games},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin, Heidelberg},
isbn = {978-3-642-40312-5},
pages = {266-277},
publisher = {Springer},
title = {On Stochastic Games with Multiple Objectives},
year = {2013}
}
TY - JOUR
ID - 1174048
AU - Chen, Taolue - Forejt, Vojtěch - Kwiatkowska, Marta - Simaitis, Aistis - Wiltsche, Clemens
PY - 2013
TI - On Stochastic Games with Multiple Objectives
PB - Springer
CY - Berlin, Heidelberg
SN - 9783642403125
KW - multi-objective verification
KW - stochastic games
N2 - We study two-player stochastic games, where the goal of one player is to satisfy a formula given as a positive boolean combination of expected total reward objectives and the behaviour of the second player is adversarial. Such games are important for modelling, synthesis and verification of open systems with stochastic behaviour. We show that finding a winning strategy is PSPACE-hard in general and undecidable for deterministic strategies. We also prove that optimal strategies, if they exist, may require infinite memory and randomisation. However, when restricted to disjunctions of objectives only, memoryless deterministic strategies suffice, and the problem of deciding whether a winning strategy exists is NP-complete. We also present algorithms to approximate the Pareto sets of achievable objectives for the class of stopping games.
ER -
CHEN, Taolue, Vojtěch FOREJT, Marta KWIATKOWSKA, Aistis SIMAITIS and Clemens WILTSCHE. On Stochastic Games with Multiple Objectives. In Krishnendu Chatterjee and Jiri Sgall. \textit{Proc. 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13)}. Berlin, Heidelberg: Springer, 2013, p.~266-277. ISBN~978-3-642-40312-5. Available from: https://dx.doi.org/10.1007/978-3-642-40313-2\_{}25.
|
