Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
How hard is it to approximate the best Nash equilibrium?
Elad Hazan
, Robert Krauthgamer
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
12
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'How hard is it to approximate the best Nash equilibrium?'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Nash Equilibrium
100%
Approximate Equilibrium
60%
Optimization Problem
40%
Two-player Games
40%
Social Welfare
40%
Clique Size
40%
Random Graphs
20%
NP-hard
20%
Polynomial-time Algorithm
20%
Difficult Problem
20%
Quasi-polynomial Time Algorithms
20%
Hidden Clique
20%
Planted Clique
20%
Algorithmic Approach
20%
Large Cliques
20%
NP-hardness
20%
Combinatorics
20%
Algorithmic Game Theory
20%
PPAD-completeness
20%
Game Behavior
20%
Economic Behavior
20%
Mathematics
Approximates
100%
Nash Equilibrium
100%
Clique
60%
Polynomial Time
40%
Random Graph
20%
Combinatorics
20%
Open Question
20%
Computer Science
Nash Equilibrium
100%
Optimization Problem
40%
Random Graphs
20%
Polynomial Time Algorithm
20%
polynomial-time algorithm
20%
Economic Behavior
20%
Economics, Econometrics and Finance
Nash Equilibrium
100%
Social Welfare
40%