On subgame perfect equilibria in turn-based reachability timed games

DOI10.1007/978-3-030-57628-8_6MaRDI QIDQ1996016zbMATH OpenOpenAlexFDO

Authors Thomas Brihaye, Aline Goeminne

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

• scientific article; zbMATH DE number 7447731 (Why is no real title available?)
• scientific article; zbMATH DE number 5301288 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1303059 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A theory of timed automata
• CONCUR 2005 – Concurrency Theory
• Computer aided synthesis: a game-theoretic approach
• Equilibrium points in n -person games
• Model-checking for real-time systems
• Nash equilibria for reachability objectives in multi-player timed games
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Reachability-Time Games on Timed Automata
• Solution concepts and algorithms for infinite multiplayer games
• The complexity of rational synthesis
• The complexity of subgame perfect equilibria in quantitative reachability games
• The element of surprise in timed games.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996016)