scientific article
From MaRDI portal
Publication:3384875
Aline Goeminne, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
Publication date: 17 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF18.2
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (6)
Unnamed Item ⋮ Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games ⋮ A Note on Game Theory and Verification ⋮ On subgame perfect equilibria in turn-based reachability timed games ⋮ On relevant equilibria in reachability games ⋮ A game-theoretic approach for the synthesis of complex systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis with rational environments
- Assume-admissible synthesis
- Games with secure equilibria
- Modalities for model checking: Branching time logic strikes back
- Automata, logics, and infinite games. A guide to current research
- Computer aided synthesis: a game-theoretic approach
- Non-Zero Sum Games for Reactive Synthesis
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- Pure Nash Equilibria in Concurrent Deterministic Games
- On the Existence of Weak Subgame Perfect Equilibria
- Perfect-Information Games with Lower-Semicontinuous Payoffs
- Rational Synthesis
- Admissibility in Infinite Games
- On the synthesis of strategies in infinite games
- The complexity of admissibility in Omega-regular games
- Secure equilibria in weighted games
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- Generalized Parity Games
- Equilibrium points in n -person games
This page was built for publication:
