Inapproximability of NP-Complete Variants of Nash Equilibrium
type: Item
instance of: scholarly article
title: Inapproximability of NP-Complete Variants of Nash Equilibrium
zbMATH Open document ID: 1343.68089
DOI: 10.1007/978-3-642-22935-0_2
author: Per Austrin
author: Mark Braverman
author: Eden Chlamtac
published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
publication date: 2011-08-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/1104.3760
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 5940138
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1828524803
arXiv ID: 1104.3760
cites work: Q4705344
cites work: New algorithms for approximate Nash equilibria in bimatrix games
cites work: Random Tensors and Planted Cliques
cites work: Settling the complexity of computing two-player Nash equilibria
cites work: New complexity results about Nash equilibria
cites work: A note on approximate Nash equilibria
cites work: The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
cites work: Q3165958
cites work: Game theory
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: How Hard Is It to Approximate the Best Nash Equilibrium?
cites work: Small Clique Detection and Approximate Nash Equilibria
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: An Optimization Approach for Approximate Nash Equilibria
Recommended article: Q3191570
Recommended article: Inapproximability of Nash Equilibrium
Recommended article: Inapproximability Results for Approximate Nash Equilibria
Recommended article: Inapproximability results for constrained approximate Nash equilibria
Recommended article: On the Complexity of Approximating a Nash Equilibrium
Recommended article: Q5365135
Recommended article: Complexity of Pure-Strategy Nash Equilibria in Non-Cooperative Games
Recommended article: On the Complexity of Nash Equilibria and Other Fixed Points
Recommended article: The Computational Complexity of Nash Equilibria in Concisely Represented Games
description: scientific article