Perspective Multi-Player Games

Kupferman, Orna; Shenwald, Noam

doi:10.1109/lics52264.2021.9470616

Cited by 3 publications

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

The Complexity of LTL Rational Synthesis

Kupferman

Shenwald

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In rational synthesis, we automatically construct a reactive system that satisfies its specification in all rational environments, namely environments that have objectives and act to fulfill them. We complete the study of the complexity of LTL rational synthesis. Our contribution is threefold. First, we tighten the known upper bounds for settings that were left open in earlier work. Second, our complexity analysis is parametric, and we describe tight upper and lower bounds in each of the problem parameters: the game graph, the objectives of the system components, and the objectives of the environment components. Third, we generalize the definition of rational synthesis, combining the cooperative and non-cooperative approaches studied in earlier work, and extend our complexity analysis to the general definition.

show abstract

The Complexity of LTL Rational Synthesis

Kupferman

Shenwald

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Perspective Games

Kupferman,

Vardi

2024

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

We introduce and study perspective games , which model multi-agent systems in which agents can view only the parts of the system that they own. As in standard multi-player turn-based games, the vertices of the game graph are partitioned among the players. Starting from an initial vertex, the players jointly generate a computation, with each player deciding the successor vertex whenever the generated computation reaches a vertex she owns. A perspective strategy for a player depends only on the history of visits in her vertices. Thus, unlike observation-based models of partial visibility, where uncertainty is longitudinal – players partially observe all vertices in the history, uncertainty in the perspective model is transverse – players fully observe part of the vertices in the history. We consider deterministic and probabilistic perspective games, with structural (e.g., Büchi or parity) and behavioral (e.g., LTL formulas) winning conditions. For these settings, we study the theoretical properties of the game as well as the decidability and complexity of the problem of deciding whether a player has a winning perspective strategy, in terms of both the game graph and the objectives. We compare perspective strategies with memoryless ones, and study an extension of the temporal logic ATL ⋆ with path quantifiers that capture perspective and memoryless strategies.

show abstract

The Complexity of LTL Rational Synthesis

Kupferman,

Shenwald

2024

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

In rational synthesis , we automatically construct a reactive system that satisfies its specification in all rational environments, namely environments that have objectives and act to fulfill them. We complete the study of the complexity of LTL rational synthesis, when the objectives are given by formulas in Linear Temporal Logic. Our contribution is threefold. First, we tighten the known upper bounds for settings that were left open in earlier work. Second, our complexity analysis is parametric, and we describe tight upper and lower bounds in each of the problem parameters: the game graph, the objectives of the system components, and the objectives of the environment components. Third, we generalize the definition of rational synthesis by adding hostile players to the setting and by combining the cooperative and non-cooperative approaches studied in earlier work.

show abstract

Perspective Multi-Player Games

Cited by 3 publications

References 33 publications

The Complexity of LTL Rational Synthesis

The Complexity of LTL Rational Synthesis

Perspective Games

The Complexity of LTL Rational Synthesis

Contact Info

Product

Resources

About