Obliging games have been introduced in the context of the game perspective on reactive synthesis in order to enforce a degree of cooperation between the to-be-synthesized system and the environment. Previous approaches to the analysis of obliging games have been small-step in the sense that they have been based on a reduction to standard (non-obliging) games in which single moves correspond to single moves in the original (obliging) game. Here, we propose a novel, large-step view on obliging games, reducing them to standard games in which single moves encode long-term behaviors in the original game. This not only allows us to give a meaningful definition of the environment winning in obliging games, but also leads to significantly improved bounds on both strategy sizes and the solution runtime for obliging games.
@InProceedings{hausmann_et_al:LIPIcs.CONCUR.2024.28, author = {Hausmann, Daniel and Piterman, Nir}, title = {{Faster and Smaller Solutions of Obliging Games}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {28:1--28:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.28}, URN = {urn:nbn:de:0030-drops-208008}, doi = {10.4230/LIPIcs.CONCUR.2024.28}, annote = {Keywords: Two-player games, reactive synthesis, Emerson-Lei games, parity games} }
Feedback for Dagstuhl Publishing