Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
DOI10.1016/j.ic.2020.104594zbMath1501.91028arXiv1809.03888OpenAlexW3035183833MaRDI QIDQ2029600
Aline Goeminne, Véronique Bruyère, Jean-François Raskin, Thomas Brihaye
Publication date: 3 June 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.03888
decidability of the constrained existence of an equilibriummultiplayer non zero-sum graph gameomega-regular objectivesweak subgame perfect equilibrium
Games involving graphs (91A43) Games involving topology, set theory, or logic (91A44) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Equilibrium refinements (91A11)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Games with secure equilibria
- Number of quantifiers is better than number of tape cells
- 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
- Explicit Muller Games are PTIME
- Perfect-Information Games with Lower-Semicontinuous Payoffs
- Rational Synthesis
- Admissibility in Infinite Games
- Handbook of Model Checking
- On the synthesis of strategies in infinite games
- The complexity of admissibility in Omega-regular games
- Secure equilibria in weighted games
- Assume-Admissible Synthesis
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed 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: Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
