Algorithmic Game Theory
Algorithmic Game Theory is a branch of theoretical computer science that studies the design and analysis of algorithms in strategic environments where rational agents make decisions based on self-interest, integrating concepts from game theory and algorithmic complexity.
4.2K
Publications
218.3K
Citations
6.4K
Authors
1.8K
Institutions
Publications per year
2017–2026
986
Variants
Agt
Parents
4.2K
Oded Goldreich, Silvio Micali, Avi Wigderson · 1987 · 3.5K citations
György Szabó, Gábor Fáth · Physics Reports · 2007 · 3K citations · Full text
1–5 of 4.2K
6.4K
31
h-index
29
h-index
26
h-index
24
h-index
21
h-index
1–5 of 6.4K
1.8K
University of California, Berkeley
Berkeley, United States
47 h-index
173 publications
17K citations
Stanford University
Stanford, United States
45 h-index
141 publications
12K citations
Carnegie Mellon University
Pittsburgh, United States
42 h-index
258 publications
13.3K citations
University of Southern California
Los Angeles, United States
35 h-index
196 publications
14K citations

University of Alberta
Edmonton, Canada
34 h-index
162 publications
18.8K citations

Tel Aviv University
Tel Aviv, Israel
32 h-index
74 publications
4.2K citations
Hebrew University of Jerusalem
Jerusalem, Israel
28 h-index
69 publications
7.4K citations
University of Illinois Urbana-Champaign
Urbana, United States
28 h-index
77 publications
6.3K citations
1–8 of 1.8K
103 publications · 7K citations
44
h-index
89 publications · 9.6K citations
34
h-index
JET · 62 publications · 5.4K citations
32
h-index
Conference · 93 publications · 3K citations
31
h-index
Repository · 151 publications · 4.4K citations
29
h-index
1–5