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

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

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)

Cites Work

• Borel determinacy
• A course in game theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Computer Science Logic
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• DAG-Width and Parity Games
• The complexity of computing a Nash equilibrium
• DAG-width
• Clique-Width and Parity Games
• Digraph measures: Kelly decompositions, games, and orderings
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games

Cited In (31)

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