Zero-sum Games

Zero-Sum Games is a class of strategic games in game theory in which, for every outcome, the sum of all players’ payoffs is identically zero, so that any gain by one player is exactly balanced by the losses of the others.

903

Publications

52.5K

Citations

1.3K

Authors

602

Institutions

Publications per year

2017–2026

216

Authors

1.3K

  1. TB
    Tamer Başar

    University of Illinois Urbana-Champaign, United States

    27 publications · 2.4K citations

    18

    h-index

  2. FL
    Frank L. Lewis

    The University of Texas at Arlington, United States

    13 publications · 2.1K citations

    13

    h-index

  3. TS
    Tüomas Sandholm

    Carnegie Mellon University, United States

    14 publications · 285 citations

    12

    h-index

  4. PC
    Pierre Cardaliaguet

    Université Paris Dauphine-PSL, France

    11 publications · 469 citations

    11

    h-index

  5. JP
    Julien Pérolat

    Google (United States), United States

    11 publications · 282 citations

    11

    h-index

1–5 of 1.3K

Venues

  1. SIAM Journal on Control and Optimization

    53 publications · 2K citations

    29

    h-index

  2. Mathematics of Operations Research

    36 publications · 1.4K citations

    24

    h-index

  3. International Journal of Game Theory

    29 publications · 1.5K citations

    19

    h-index

  4. arXiv (Cornell University)

    Repository · 42 publications · 1K citations

    19

    h-index

  5. Journal of Optimization Theory and Applications

    25 publications · 2.1K citations

    18

    h-index

1–5