On subgame perfect equilibria in turn-based reachability timed games

DOI10.1007/978-3-030-57628-8_6OpenAlexW3082128731MaRDI QIDQ1996016

Aline Goeminne, Thomas Brihaye

Publication date: 2 March 2021

Full work available at URL: https://arxiv.org/abs/2006.10491

zbMATH Keywords

reachability objectivessubgame perfect equilibriaconstrained existence problemmultiplayer turn-based timed games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Computer aided synthesis: a game-theoretic approach
• Nash Equilibria for Reachability Objectives in Multi-player Timed Games
• The Complexity of Rational Synthesis
• Model-checking for real-time systems
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Reachability-Time Games on Timed Automata
• Equilibrium points in n -person games
• CONCUR 2005 – Concurrency Theory
• CONCUR 2003 - Concurrency Theory

This page was built for publication: On subgame perfect equilibria in turn-based reachability timed games