Paper Info
Title
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Abstract
In this paper, we study turn-based multiplayer quantitative 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 focus on existence results for two solution concepts: Nash equilibrium and secure equilibrium. We prove the existence of finite-memory Nash (resp. secure) equilibria in n-player (resp. 2-player) games. For the case of Nash equilibria, we extend our result in two directions. First, we show that finite-memory Nash equilibria still exist when the model is enriched by allowing n-tuples of positive costs on edges (one cost by player). Secondly, we prove the existence of Nash equilibria in quantitative games with both reachability and safety objectives.
Year
DOI
Venue
2012
10.1007/s00224-013-9495-7
Theory Comput. Syst.
Keywords
DocType
Volume
Turn-based quantitative game,Nash equilibrium,Secure equilibrium,Reachability/Safety objectives
Journal
54
Issue
ISSN
Citations 
2
1432-4350
3
PageRank 
References 
Authors
0.40
10
3
Name
Order
Citations
PageRank
Thomas Brihaye146035.91
Véronique Bruyère242943.59
Julie De Pril3292.95