Computational Game Theory
Computational Game Theory is a subfield of game theory that applies computational methods and algorithms to analyze and solve strategic interactions among rational agents, distinguishing itself by focusing on the complexity, efficiency, and feasibility of computing equilibria and optimal strategies in strategic form games and other game representations.
2.7K
Publications
141.6K
Citations
5.9K
Authors
1.8K
Institutions
Publications per year
2017–2026
889
2.7K
Oded Goldreich, Silvio Micali, Avi Wigderson · 1987 · 3.5K citations
Algorithms, games, and the internet
Christos H. Papadimitriou · 2001 · 1.1K citations
1–5 of 2.7K
5.9K
25
h-index
20
h-index
18
h-index
University of California, Berkeley, United States
19 publications · 3.6K citations
17
h-index
15
h-index
1–5 of 5.9K
1.8K
Stanford University
Stanford, United States
34 h-index
85 publications
7.3K citations
Carnegie Mellon University
Pittsburgh, United States
31 h-index
117 publications
6.5K citations
University of California, Berkeley
Berkeley, United States
28 h-index
72 publications
7.8K citations

University of Alberta
Edmonton, Canada
26 h-index
103 publications
5.8K citations

Centre National de la Recherche Scientifique
Paris, France
23 h-index
94 publications
3.4K citations
Nanyang Technological University
Singapore, Singapore
21 h-index
51 publications
3.8K citations

University of Liverpool
Liverpool, United Kingdom
20 h-index
63 publications
3.1K citations
Duke University
Durham, United States
20 h-index
53 publications
3.2K citations
1–8 of 1.8K
Repository · 100 publications · 4.2K citations
30
h-index
Conference · 43 publications · 1.6K citations
23
h-index
27 publications · 2.2K citations
21
h-index
33 publications · 1.1K citations
19
h-index
22 publications · 906 citations
18
h-index
1–5