The Complexity of Nash Equilibria in Infinite Multiplayer Games

DOI10.1007/978-3-540-78499-9_3zbMATH Open1138.91359OpenAlexW1589508846MaRDI QIDQ5458348FDOQ5458348

Authors Michael Ummels

Publication date 11 April 2008

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78499-9_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) (n)-person games, (n>2) (91A06) Games involving graphs (91A43)

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

• scientific article; zbMATH DE number 3777289 (Why is no real title available?)
• scientific article; zbMATH DE number 3078993 (Why is no real title available?)
• A course in game theory.
• Borel determinacy
• Clique-Width and Parity Games
• Computer Science Logic
• DAG-Width and Parity Games
• DAG-width
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Digraph measures: Kelly decompositions, games, and orderings
• 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

(30)

• The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
• Incentive Stackelberg mean-payoff games
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• The Complexity of Nash Equilibria in Limit-Average Games
• Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games
• Robust equilibria in mean-payoff games
• scientific article; zbMATH DE number 7649921 (Why is no real title available?)
• On pure Nash equilibria in stochastic games
• Equilibria in multi-player multi-outcome infinite sequential games
• A game-theoretic approach to indistinguishability of winning objectives as user privacy
• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
• Stackelberg-Pareto synthesis
• Nash equilibria and values through modular partitions in infinite games
• Decision Problems for Nash Equilibria in Stochastic Games
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Multiplayer cost games with simple Nash equilibria
• scientific article; zbMATH DE number 7561653 (Why is no real title available?)
• Subgame-perfect Equilibria in Mean-payoff Games (journal version)
• The complexity of Nash equilibria in stochastic multiplayer games
• Optimal strategic reasoning with McNaughton functions
• Making the best of limited memory in multi-player discounted sum games
• The complexity of subgame perfect equilibria in quantitative reachability games
• A Note on Game Theory and Verification
• The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
• Mixed Nash equilibria in concurrent terminal-reward games
• Solution concepts and algorithms for infinite multiplayer games
• Stochastic equilibria under imprecise deviations in terminal-reward concurrent games
• scientific article; zbMATH DE number 7447731 (Why is no real title available?)
• A game-theoretic approach for the synthesis of complex systems
• Extending finite-memory determinacy to multi-player 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)