Game Trees is a structured representation in game theory that models sequential decision-making among rational agents by depicting all possible moves and outcomes in a directed acyclic graph, where nodes represent decision points and branches represent feasible actions, distinguished from other graphical representations by its explicit incorporation of temporal order, perfect recall, and extensive-form structure.
209
Publications
8.5K
Citations
375
Authors
187
Institutions
Publications per year
2017–2026
19
Parents
Publications
209
1–5 of 209
Authors
375
- DN
10
h-index
- TS
8
h-index
- MH
7
h-index
- JU
5
h-index
- MM
5
h-index
1–5 of 375
Institutions
187
University of Alberta
Edmonton, Canada
15 h-index
28 publications
1.7K citations
Maastricht University
Maastricht, The Netherlands
12 h-index
23 publications
1.1K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
18 publications
933 citations
University of Maryland, College Park
College Park, United States
10 h-index
19 publications
504 citations
Tilburg University
Tilburg, The Netherlands
7 h-index
10 publications
497 citations
University of California, Los Angeles
Los Angeles, United States
7 h-index
9 publications
443 citations
University of California, Berkeley
Berkeley, United States
7 h-index
12 publications
514 citations
Tinbergen Institute
Rotterdam, The Netherlands
5 h-index
6 publications
282 citations
1–8 of 187
Venues
- ICGA Journal
17 publications · 433 citations
14
h-index
- International Joint Conference on Artificial Intelligence
Conference · 9 publications · 274 citations
9
h-index
- Artificial Intelligence
7 publications · 578 citations
7
h-index
- Journal of the ACM
JACM · 5 publications · 346 citations
5
h-index
- Theoretical Computer Science
4 publications · 97 citations
4
h-index
1–5