On Stochastic Games with Multiple Objectives

D 2013

On Stochastic Games with Multiple Objectives

CHEN, Taolue, Vojtěch FOREJT, Marta KWIATKOWSKA, Aistis SIMAITIS, Clemens WILTSCHE et. al.

Basic information

Original name

On Stochastic Games with Multiple Objectives

Authors

CHEN, Taolue (156 China), Vojtěch FOREJT (203 Czech Republic, guarantor, belonging to the institution), Marta KWIATKOWSKA (826 United Kingdom of Great Britain and Northern Ireland), Aistis SIMAITIS (440 Lithuania) and Clemens WILTSCHE (40 Austria)

Edition

Berlin, Heidelberg, Proc. 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), p. 266-277, 12 pp. 2013

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/13:00072858

Organization unit

Faculty of Informatics

ISBN

978-3-642-40312-5

ISSN

DOI

http://dx.doi.org/10.1007/978-3-642-40313-2_25

UT WoS

000342994500025

Keywords in English

multi-objective verification; stochastic games

Abstract

V originále

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.

Links

LG13010, research and development project

Name: Zastoupení ČR v European Research Consortium for Informatics and Mathematics (Acronym: ERCIM-CZ)

Investor: Ministry of Education, Youth and Sports of the CR

MUNI/33/IP1/2013, interní kód MU

Name: Podpora perspektivních výzkumných týmů Fakulty informatiky a vynikajících vědeckých pracovníků z jiných institucí působících na Fakultě informatiky (Acronym: PVT-VVPZ)

Investor: Masaryk University

Citovat

CHEN, Taolue, Vojtěch FOREJT, Marta KWIATKOWSKA, Aistis SIMAITIS and Clemens WILTSCHE. On Stochastic Games with Multiple Objectives. In Krishnendu Chatterjee and Jiri Sgall. 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.

@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.

Detailed Information on Publication Record