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
Finitary winning in ω-regular games
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Computing equilibria in two-player timed games via turn-based finite games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Iterated regret minimization in game graphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Nash equilibria in concurrent priced games
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Subgame perfection for equilibria in quantitative reachability games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Theory of Computing Systems
| Hi-index | 0.00 |
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.