Articles, chapters, papers, reports Department of Computer Science and Engineering

Browse

Now showing 1 - 1 of 1

Faster and Smaller Solutions of Obliging Games
(35th International Conference on Concurrency Theory (CONCUR 2024), 2024) Hausmann, Daniel; Piterman, Nir
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.