Nash Equilibria for Reachability Objectives in Multi-player Timed Games
From MaRDI portal
Publication:3584930
DOI10.1007/978-3-642-15375-4_14zbMath1287.68123OpenAlexW1565676156MaRDI QIDQ3584930
Romain Brenguier, Nicolas Markey, Patricia Bouyer
Publication date: 31 August 2010
Published in: CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15375-4_14
Applications of game theory (91A80) (n)-person games, (n>2) (91A06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Multiplayer Cost Games with Simple Nash Equilibria, On subgame perfect equilibria in turn-based reachability timed games, The Complexity of Nash Equilibria in Limit-Average Games
Uses Software