The Complexity of Nash Equilibria in Infinite Multiplayer Games
From MaRDI portal
(Redirected from Publication:5458348)
Recommendations
- The complexity of Nash equilibria in stochastic multiplayer games
- Solution concepts and algorithms for infinite multiplayer games
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
- Decision Problems for Nash Equilibria in Stochastic Games
- The Complexity of Nash Equilibria in Limit-Average Games
Cites work
- A course in game theory.
- Borel determinacy
- Clique-Width and Parity Games
- Computer Science Logic
- DAG-width
- DAG-Width and Parity Games
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Digraph measures: Kelly decompositions, games, and orderings
- scientific article; zbMATH DE number 3777289 (Why is no real title available?)
- scientific article; zbMATH DE number 3078993 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- The complexity of computing a Nash equilibrium
Cited in
(35)- Extending finite-memory determinacy to multi-player games
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
- A game-theoretic approach for the synthesis of complex systems
- Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games
- Equilibria in multi-player multi-outcome infinite sequential games
- Optimal strategic reasoning with McNaughton functions
- Robust equilibria in mean-payoff games
- On pure Nash equilibria in stochastic games
- Mixed Nash equilibria in concurrent terminal-reward games
- The Complexity of Nash Equilibria in Limit-Average Games
- The complexity of Nash equilibria in stochastic multiplayer games
- A Note on Game Theory and Verification
- Constrained existence problem for weak subgame perfect equilibria with -regular Boolean objectives
- Multiplayer cost games with simple Nash equilibria
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
- Decision Problems for Nash Equilibria in Stochastic Games
- Nash equilibria and values through modular partitions in infinite games
- Incentive Stackelberg mean-payoff games
- Solution concepts and algorithms for infinite multiplayer games
- Making the best of limited memory in multi-player discounted sum games
- Stochastic equilibria under imprecise deviations in terminal-reward concurrent games
- Nash equilibria in games over graphs equipped with a communication mechanism
- The complexity of subgame perfect equilibria in quantitative reachability games
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- scientific article; zbMATH DE number 7649921 (Why is no real title available?)
- Subgame-perfect Equilibria in Mean-payoff Games (journal version)
- Stackelberg-Pareto synthesis
- A game-theoretic approach to indistinguishability of winning objectives as user privacy
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
- Arena-independent memory bounds for Nash equilibria in reachability games
- Arena-independent memory bounds for Nash equilibria in reachability games
- Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
- Games with trading of control
- Verification with common knowledge of rationality for graph games
This page was built for publication: The Complexity of Nash Equilibria in Infinite Multiplayer Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458348)
