Nash equilibria: complexity, symmetries, and approximation
type: Item
instance of: scholarly article
title: Nash equilibria: complexity, symmetries, and approximation
zbMATH Open document ID: 1303.91010
author: Constantinos Daskalakis
published in: Computer Science Review
publication date: 2014-10-07T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91-02
Mathematics Subject Classification ID: 68-02
zbMATH DE Number: 6352109
zbMATH Keywords: Nash equilibria
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.cosrev.2009.03.003
OpenAlex ID: W122730496
cites work: Algorithmic mechanism design (extended abstract)
cites work: Algorithmic Game Theory
cites work: The complexity of computing a Nash equilibrium
cites work: Approximate Nash equilibria in anonymous games
cites work: An Efficient PTAS for Two-Strategy Anonymous Games
cites work: On oblivious PTAS's for nash equilibrium
cites work: Q5844986
cites work: Non-cooperative games
cites work: Q3844775
cites work: Q4197641
cites work: Equilibrium Points of Bimatrix Games
cites work: Computing Equilibria of N-Person Games
cites work: On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
cites work: The Approximation of Fixed Points of a Continuous Mapping
cites work: Exponential lower bounds for finding Brouwer fixed points
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: New complexity results about Nash equilibria
cites work: On total functions, existence theorems and computational complexity
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: On the Complexity of Nash Equilibria and Other Fixed Points
cites work: Games of fixed rank: a hierarchy of bimatrix games
cites work: A note on approximate Nash equilibria
cites work: New algorithms for approximate Nash equilibria in bimatrix games
cites work: An Optimization Approach for Approximate Nash Equilibria
cites work: Computing equilibria in multi-player games
cites work: Q1185456
cites work: Q5801629
cites work: Q5801630
cites work: Congestion games with player-specific payoff functions
cites work: The women of Cairo: equilibria in large anonymous games
DOI: 10.1016/J.COSREV.2009.03.003
Recommended article: Symmetries and the complexity of pure Nash equilibrium
Recommended article: Symmetries and the Complexity of Pure Nash Equilibrium
Recommended article: On the Complexity of Approximating a Nash Equilibrium
Recommended article: Q5365135
Recommended article: The complexity of pure Nash equilibria
Recommended article: The complexity of computational problems about Nash equilibria in symmetric win-lose games
Recommended article: Q3524711
Recommended article: On the Complexity of Nash Equilibria and Other Fixed Points
Recommended article: Approximations of Nash equilibria
Recommended article: The Complexity of Computing a Nash Equilibrium
description: scientific article; zbMATH DE number 6352109