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

Authors

5.9K

  1. TS
    Tüomas Sandholm

    Carnegie Mellon University, United States

    42 publications · 2.6K citations

    25

    h-index

  2. VC
    Vincent Conitzer

    Duke University, United States

    25 publications · 2.1K citations

    20

    h-index

  3. MW
    Michael Wooldridge

    University of Liverpool, United Kingdom

    20 publications · 1K citations

    18

    h-index

  4. CH
    Christos H. Papadimitriou

    University of California, Berkeley, United States

    19 publications · 3.6K citations

    17

    h-index

  5. MT
    Milind Tambe

    University of Southern California, United States

    15 publications · 1.1K citations

    15

    h-index

1–5 of 5.9K

Venues

  1. arXiv (Cornell University)

    Repository · 100 publications · 4.2K citations

    30

    h-index

  2. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 43 publications · 1.6K citations

    23

    h-index

  3. Games and Economic Behavior

    27 publications · 2.2K citations

    21

    h-index

  4. IEEE Access

    33 publications · 1.1K citations

    19

    h-index

  5. Theoretical Computer Science

    22 publications · 906 citations

    18

    h-index

1–5