The complexity of computing a Nash equilibrium
From MaRDI portal
(Redirected from 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)- Symmetries and the complexity of pure 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
- Existence of equilibria in a decentralized two-level supply chain
- On the complexity of 2D discrete fixed point problem
- New algorithms for approximate Nash equilibria in bimatrix games
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
- Nash equilibria in all-optical networks
- Computational complexity in additive hedonic games
- Nash and correlated equilibria: Some complexity considerations
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
- Computing pure Nash equilibria in network revenue management games
- Random bimatrix games are asymptotically easy to solve (a simple proof)
- 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
- 2-D Tucker is PPA complete
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Introduction to computer science and economic theory
- Approximate Nash equilibria in anonymous games
- Computer science and decision theory
- Cache me if you can: capacitated selfish replication games in networks
- Introduction to the special issue on learning and computational game theory
- ReGale: some memorable results
- Higher order game dynamics
- Deterministic calibration and Nash equilibrium
- Optimal deterministic auctions with correlated priors
- Zero-sum polymatrix games: a generalization of minmax
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Convergence method, properties and computational complexity for Lyapunov games
- Finding Gale strings
- How discontinuous is computing Nash equilibria? (Extended abstract)
- Reducibility among equilibrium problems
- On the complexity of approximating a Nash equilibrium
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Multilinear games
- scientific article; zbMATH DE number 6612107 (Why is no real title available?)
- On the Complexity of Nash Equilibria and Other Fixed Points
- How incomputable is finding Nash equilibria?
- How do you like your equilibrium selection problems? Hard, or very hard?
- A direct reduction from k-player to 2-player approximate Nash equilibrium
- The computational complexity of trembling hand perfection and other equilibrium refinements
- Beyond Nash equilibrium: solution concepts for the 21st century
- Computability of Nash equilibrium
- Settling the complexity of computing two-player Nash equilibria
- Reasoning about equilibria in game-like concurrent systems
- Inverse game theory: learning utilities in succinct games
- Complexity of Verifying Game Equilibria
- scientific article; zbMATH DE number 5722763 (Why is no real title available?)
- Noncooperative cost spanning tree games with budget restrictions
- Decision Problems for Nash Equilibria in Stochastic Games
- The computational complexity of weak saddles
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma
- Computing Cournot-Nash Equilibria
- Propositional proofs and reductions between NP search problems
- Recent development in computational complexity characterization of Nash equilibrium
- Equilibria, fixed points, and complexity classes
- Nash equilibria: complexity, symmetries, and approximation
- scientific article; zbMATH DE number 6866322 (Why is no real title available?)
- Robust and scalable middleware for selfish-computer systems
- scientific article; zbMATH DE number 1842054 (Why is no real title available?)
- Equilibria, fixed points, and complexity classes
- Approximate equilibria in strongly symmetric games
- Equilibria, fixed points, and computational complexity -- Nevanlinna prize lecture
- Structure versus hardness through the obfuscation lens
- The complexity of computing a Nash equilibrium
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- TFNP: an update
- On minmax theorems for multiplayer games
- scientific article; zbMATH DE number 6783488 (Why is no real title available?)
- Complexity of pure-strategy Nash equilibria in non-cooperative games
- Reducibility among fractional stability problems
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- The Complexity of Zero Knowledge
- Approximate Equilibria for Strategic Two Person Games
- The Local and Global Price of Anarchy of Graphical Games
- Approximate Nash Equilibria for Multi-player Games
- Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
- Computing correlated equilibria in multi-player games
- Computing Nash equilibria for scheduling on restricted parallel links
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
- A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
- PPAD is as hard as LWE and iterated squaring
- Action-graph games
- Equilibria of graphical games with symmetries
- Local and global price of anarchy of graphical games
- Convergence to approximate Nash equilibria in congestion games
- Correlated equilibria in continuous games: characterization and computation
- On the performance of approximate equilibria in congestion games
- The computational complexity of weak saddles
- Equilibria problems on games: complexity versus succinctness
- Load balancing without regret in the bulletin board model
- A FPTAS for computing a symmetric leontief competitive economy equilibrium
- Computing equilibria in discounted dynamic games
- A polynomial-time algorithm for 1/3-approximate Nash equilibria in bimatrix games
- Swim till you sink: computing the limit of a game
- An interior-point path-following algorithm for computing a Leontief economy equilibrium
- Alternating minima and maxima, Nash equilibria and bounded arithmetic
- Some results of Maria Serna on strategic games: complexity of equilibria and models
- Ranking games
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)
