Theoretical Computer Science
Alternating-time temporal logic
Journal of the ACM (JACM)
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Games in system design and verification
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
The complexity of Nash equilibria in infinite multiplayer games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Decision problems for Nash equilibria in stochastic games
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Nash equilibria for reachability objectives in multi-player timed games
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Rational behaviour and strategy construction in infinite multiplayer games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Equilibria in quantitative reachability games
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Nash equilibrium in weighted concurrent timed games with reachability objectives
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformations that builds two finite turn-based games out of a timed game, with a precise correspondence between Nash equilibria in the original and in final games. This provides us with an algorithm to compute Nash equilibria in two-player timed games for large classes of properties.