Equilibria in Quantitative Reachability Games

In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching his own goal as soon as possible. We prove existence of finite-memory Nash (resp. secure) equilibria in multiplayer (resp. two-player) games.

• Type: Conference
• Year: 2010
• Where: CSR
• Authors: Thomas Brihaye, Véronique Bruyère, Julie De Pril
• Keywords: CSR 2010, Non Zero-sum Games, Reachability Objectives, Theoretical Computer Science, Turn-based Quantitative Multiplayer