Stackelberg-Pareto synthesis
From MaRDI portal
Publication:6492409
DOI10.1145/3651162WikidataQ130949683 ScholiaQ130949683MaRDI QIDQ6492409
Clément Tamines, Jean-François Raskin, Baptiste Fievet, Véronique Bruyère
Publication date: 25 April 2024
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis with rational environments
- CNF and DNF succinct graph encodings
- Games with secure equilibria
- Strategy logic
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Computer aided synthesis: a game-theoretic approach
- Non-Zero Sum Games for Reactive Synthesis
- Pure Nash Equilibria in Concurrent Deterministic Games
- Reasoning About Strategies
- The Complexity of Nash Equilibria in Limit-Average Games
- Explicit Muller Games are PTIME
- Automata Theory and Model Checking
- Graph Games and Reactive Synthesis
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
- Rational Synthesis
- Admissibility in Infinite Games
- The Complexity of Rational Synthesis
- On the complexity of heterogeneous multidimensional quantitative games
- Reducibility among Combinatorial Problems
- Deciding Parity Games in Quasi-polynomial Time
- Assume-Admissible Synthesis
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- Assume-Guarantee Synthesis
- Equilibrium points in n -person games
- Practical “Paritizing” of Emerson-Lei Automata
This page was built for publication: Stackelberg-Pareto synthesis