License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2020.39
URN: urn:nbn:de:0030-drops-132807
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13280/
Bertrand, Nathalie ;
Bouyer, Patricia ;
Majumdar, Anirban
Synthesizing Safe Coalition Strategies
Abstract
Concurrent games with a fixed number of agents have been thoroughly studied, with various solution concepts and objectives for the agents. In this paper, we consider concurrent games with an arbitrary number of agents, and study the problem of synthesizing a coalition strategy to achieve a global safety objective. The problem is non-trivial since the agents do not know a priori how many they are when they start the game. We prove that the existence of a safe arbitrary-large coalition strategy for safety objectives is a PSPACE-hard problem that can be decided in exponential space.
BibTeX - Entry
@InProceedings{bertrand_et_al:LIPIcs:2020:13280,
author = {Nathalie Bertrand and Patricia Bouyer and Anirban Majumdar},
title = {{Synthesizing Safe Coalition Strategies}},
booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
pages = {39:1--39:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-174-0},
ISSN = {1868-8969},
year = {2020},
volume = {182},
editor = {Nitin Saxena and Sunil Simon},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13280},
URN = {urn:nbn:de:0030-drops-132807},
doi = {10.4230/LIPIcs.FSTTCS.2020.39},
annote = {Keywords: concurrent games, parameterized verification, strategy synthesis}
}
Keywords: |
|
concurrent games, parameterized verification, strategy synthesis |
Collection: |
|
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
04.12.2020 |