Equilibrium Computation
Equilibrium Computation is a computational method within game theory that specifically identifies strategies for players in zero-sum games wherein no participant can benefit from unilateral deviation, thereby determining stable outcomes under optimal play.
372
Publications
19.8K
Citations
565
Authors
276
Institutions
Publications per year
2017–2026
68
Parents
372
The complexity of pure Nash equilibria
Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar · 2004 · 662 citations
Settling the complexity of computing two-player Nash equilibria
Xi Chen, Xiaotie Deng, Shang‐Hua Teng · Journal of the ACM · 2009 · 579 citations
1–5 of 372
565
16
h-index
University of California, Berkeley, United States
16 publications · 3.4K citations
15
h-index
Massachusetts Institute of Technology, United States
11 publications · 2.3K citations
11
h-index
11
h-index
10
h-index
1–5 of 565
276
University of California, Berkeley
Berkeley, United States
19 h-index
37 publications
5.8K citations
Stanford University
Stanford, United States
19 h-index
46 publications
2.5K citations
Carnegie Mellon University
Pittsburgh, United States
17 h-index
51 publications
2.4K citations

University of Liverpool
Liverpool, United Kingdom
11 h-index
29 publications
982 citations
Georgia Institute of Technology
Atlanta, United States
8 h-index
15 publications
1.4K citations

Tilburg University
Tilburg, The Netherlands
8 h-index
11 publications
401 citations

Aarhus University
Aarhus, Denmark
8 h-index
13 publications
370 citations
Politecnico di Milano
Milan, Italy
8 h-index
19 publications
312 citations
1–8 of 276
Repository · 19 publications · 372 citations
12
h-index
Conference · 10 publications · 257 citations
10
h-index
7 publications · 284 citations
7
h-index
7 publications · 402 citations
7
h-index
6 publications · 702 citations
6
h-index
1–5