Sciweavers

Share
CSR
2010
Springer

Equilibria in Quantitative Reachability Games

8 years 8 months ago
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.
Thomas Brihaye, Véronique Bruyère, J
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where CSR
Authors Thomas Brihaye, Véronique Bruyère, Julie De Pril
Comments (0)
books