The complexity of computing a Nash equilibrium
From MaRDI portal
Publication:2931371
Recommendations
- The complexity of computing a Nash equilibrium
- The complexity of finding Nash equilibria
- On the complexity of approximating a Nash equilibrium
- scientific article; zbMATH DE number 6783488
- Computability of Nash equilibrium
- scientific article; zbMATH DE number 1842054
- On the computability of Nash equilibria
- The complexity of pure Nash equilibria
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Settling the complexity of computing two-player Nash equilibria
Cited in
(only showing first 100 items - show all)- On the performance of approximate equilibria in congestion games
- A direct reduction from \(k\)-player to 2-player approximate Nash equilibrium
- Approximate Equilibria for Strategic Two Person Games
- Symmetries and the complexity of pure Nash equilibrium
- Robust and scalable middleware for selfish-computer systems
- The computational complexity of weak saddles
- Settling the complexity of computing two-player Nash equilibria
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
- scientific article; zbMATH DE number 6783488 (Why is no real title available?)
- Equilibria, fixed points, and complexity classes
- Local and global price of anarchy of graphical games
- Reasoning about equilibria in game-like concurrent systems
- Walrasian equilibrium: Hardness, approximations and tractable instances
- Convergence method, properties and computational complexity for Lyapunov games
- Inverse game theory: learning utilities in succinct games
- Propositional proofs and reductions between NP search problems
- Alternating minima and maxima, Nash equilibria and bounded arithmetic
- Imitation games and computation
- Higher order game dynamics
- Correlated equilibria in continuous games: characterization and computation
- Computer science and decision theory
- How incomputable is finding Nash equilibria?
- Deterministic calibration and Nash equilibrium
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Some results of Maria Serna on strategic games: complexity of equilibria and models
- Ranking games
- Approximate Nash equilibria in anonymous games
- Well supported approximate equilibria in bimatrix games
- An interior-point path-following algorithm for computing a Leontief economy equilibrium
- Existence of equilibria in a decentralized two-level supply chain
- The computational complexity of evolutionarily stable strategies
- Nash and correlated equilibria: Some complexity considerations
- A FPTAS for computing a symmetric leontief competitive economy equilibrium
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
- On the Complexity of Nash Equilibria and Other Fixed Points
- Computing Cournot-Nash Equilibria
- The complexity of equilibria: Hardness results for economies via a correspondence with games
- Approximate Nash Equilibria for Multi-player Games
- Nash equilibria: complexity, symmetries, and approximation
- Computing equilibria in discounted dynamic games
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma
- Convergence to approximate Nash equilibria in congestion games
- Finding Gale strings
- New algorithms for approximate Nash equilibria in bimatrix games
- Action-graph games
- Computational complexity in additive hedonic games
- Reducibility among equilibrium problems
- Separable and low-rank continuous games
- The complexity of computing a Nash equilibrium
- A note on approximate Nash equilibria
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- A simplicial approach for discrete fixed point theorems
- Computing correlated equilibria in multi-player games
- The myth of the folk theorem
- Noncooperative cost spanning tree games with budget restrictions
- Load balancing without regret in the bulletin board model
- How discontinuous is computing Nash equilibria? (Extended abstract)
- Approximate equilibria in strongly symmetric games
- Introduction to computer science and economic theory
- New complexity results about Nash equilibria
- Computing Nash equilibria for scheduling on restricted parallel links
- Equilibria problems on games: complexity versus succinctness
- Zero-sum polymatrix games: a generalization of minmax
- On minmax theorems for multiplayer games
- On the complexity of constrained Nash equilibria in graphical games
- Equilibria, fixed points, and complexity classes
- Recent development in computational complexity characterization of Nash equilibrium
- On the complexity of approximating a Nash equilibrium
- Equilibria of graphical games with symmetries
- Computing equilibria: a computational complexity perspective
- The complexity of uniform Nash equilibria and related regular subgraph problems
- A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
- scientific article; zbMATH DE number 6612107 (Why is no real title available?)
- On the complexity of deciding bimatrix games similarity
- The Complexity of Zero Knowledge
- On the complexity of 2D discrete fixed point problem
- Nash equilibria in all-optical networks
- Optimal deterministic auctions with correlated priors
- ReGale: some memorable results
- How do you like your equilibrium selection problems? Hard, or very hard?
- Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
- scientific article; zbMATH DE number 1842054 (Why is no real title available?)
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form
- Computability of Nash equilibrium
- The Local and Global Price of Anarchy of Graphical Games
- The computational complexity of weak saddles
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Computing pure Nash equilibria in network revenue management games
- Decision Problems for Nash Equilibria in Stochastic Games
- Multilinear games
- Beyond Nash equilibrium: solution concepts for the 21st century
- The computation of approximate competitive equilibrium is PPAD-hard
- Equilibria, fixed points, and computational complexity -- Nevanlinna prize lecture
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
- Reducibility among fractional stability problems
- Complexity of Verifying Game Equilibria
- Structure versus hardness through the obfuscation lens
- The computational complexity of trembling hand perfection and other equilibrium refinements
- Random bimatrix games are asymptotically easy to solve (a simple proof)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
This page was built for publication: The complexity of computing a Nash equilibrium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931371)
