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
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Church's problem and a tour through automata theory
Pillars of computer science
Nash equilibria for reachability objectives in multi-player timed games
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
Nash equilibria in concurrent priced games
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria in the multiplayer case remained, and is still an open problem. In this paper, we focus our study on the concept of subgame perfect equilibrium, a refinement of Nash equilibrium well-suited in the framework of games played on graphs. We also introduce the new concept of subgame perfect secure equilibrium. We prove the existence of subgame perfect equilibria (resp. subgame perfect secure equilibria) in multiplayer (resp. two-player) quantitative reachability games. Moreover, we provide an algorithm deciding the existence of secure equilibria in the multiplayer case.