Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives-Reference-Cited by-同舟云学术

Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives

Published:2023 Issue: Volume: Page:541-560
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bordais Benjamin,Bouyer Patricia,Roux Stéphane Le

Abstract

AbstractWe investigate concurrent two-player win/lose stochastic games on finite graphs with prefix-independent objectives. We characterize subgame optimal strategies and use this characterization to show various memory transfer results: 1) For a given (prefix-independent) objective, if every game that has a subgame almost-surely winning strategy also has a positional one, then every game that has a subgame optimal strategy also has a positional one; 2) Assume that the (prefix-independent) objective has a neutral color. If every turn-based game that has a subgame almost-surely winning strategy also has a positional one, then every game that has a finite-choice (notion to be defined) subgame optimal strategy also has a positional one.We collect or design examples to show that our results are tight in several ways. We also apply our results to Büchi, co-Büchi, parity, mean-payoff objectives, thus yielding simpler statements.

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-30829-1_26

Reference20 articles.

1. Roderick Bloem, Krishnendu Chatterjee, and Barbara Jobstmann. Handbook of Model Checking, chapter Graph games and reactive synthesis, pages 921–962. Springer, 2018.

2. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. From local to global determinacy in concurrent graph games. In Mikolaj Bojanczyk and Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference, volume 213 of LIPIcs, pages 41:1–41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

3. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Optimal strategies in concurrent reachability games. In Florin Manea and Alex Simpson, editors, 30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference), volume 216 of LIPIcs, pages 7:1–7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

4. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Playing (almost-)optimally in concurrent büchi and co-büchi games. CoRR, abs/2203.06966, 2022.

5. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Sub-game optimal strategies in concurrent games with prefix-independent objectives. CoRR, abs/2301.10697, 2023.