Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The complexity of mean payoff games on graphs
Theoretical Computer Science
Perfect information stochastic games and related classes
International Journal of Game Theory
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Games in system design and verification
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Theoretical Computer Science
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
On Omega-Languages Defined by Mean-Payoff Conditions
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
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
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the Complexity of Numerical Analysis
SIAM Journal on Computing
The Complexity of Computing a Nash Equilibrium
SIAM Journal on Computing
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
Nash equilibria for reachability objectives in multi-player timed games
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
Church synthesis problem for noisy input
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
TACAS'10 Proceedings of the 16th 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
Concurrent games with ordered objectives
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
The complexity of infinitely repeated alternating move games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
PRALINE: a tool for computing nash equilibria in concurrent games
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a Nash equilibrium in pure strategies is decidable, even if we put a constraint on the payoff of the equilibrium. Our undecidability result holds even for a restricted class of concurrent games, where nonzero rewards occur only on terminal states. Moreover, we show that the constrained existence problem is undecidable not only for concurrent games but for turn-based games with the same restriction on rewards. Finally, we prove that the constrained existence problem for Nash equilibria in (pure or randomised) stationary strategies is decidable and analyse its complexity.