On subgame perfect equilibria in turn-based reachability timed games

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

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

• Equilibrium points in n -person games
• A theory of timed automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reachability-Time Games on Timed Automata
• Title not available (Why is that?)
• The complexity of rational synthesis
• CONCUR 2005 – Concurrency Theory
• Model-checking for real-time systems
• The element of surprise in timed games.
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Computer aided synthesis: a game-theoretic approach
• Solution concepts and algorithms for infinite multiplayer games
• Title not available (Why is that?)
• Nash equilibria for reachability objectives in multi-player timed games
• The complexity of subgame perfect equilibria in quantitative reachability 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)