Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Theoretical Computer Science - Components and objects
Ranking Automata and Games for Prioritized Requirements
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Optimal Strategy Synthesis in Request-Response Games
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Time-Optimal Winning Strategies for Poset Games
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Equilibria in quantitative reachability games
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Finitary winning in ω-regular games
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
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.