Finite Zero-sum Games

Finite Zero-Sum Games is a subclass of strategic games in game theory characterized by a finite set of strategies for each player and the property that the total payoffs to all players sum to zero for every possible outcome.

71

Publications

5.8K

Citations

115

Authors

85

Institutions

Publications per year

2017–2026

9

Authors

115

  1. AS
    Andrzej S. Nowak

    University of Zielona Góra, Poland

    3 publications · 140 citations

    3

    h-index

  2. MA
    Marwan A. Simaan

    University of Pittsburgh, United States

    3 publications · 1K citations

    3

    h-index

  3. JC
    J.B. Cruz

    The Ohio State University, United States

    3 publications · 1.1K citations

    3

    h-index

  4. TE
    T. E. S. Raghavan

    University of Illinois Chicago, United States

    3 publications · 221 citations

    3

    h-index

  5. NP
    Nir Piterman

    University of Leicester, United Kingdom

    2 publications · 244 citations

    2

    h-index

1–5 of 115

Venues

  1. Journal of Optimization Theory and Applications

    9 publications · 1.7K citations

    9

    h-index

  2. SIAM Journal on Control and Optimization

    4 publications · 79 citations

    4

    h-index

  3. International Journal of Game Theory

    4 publications · 160 citations

    4

    h-index

  4. Mathematics of Operations Research

    4 publications · 115 citations

    4

    h-index

  5. arXiv (Cornell University)

    Repository · 3 publications · 194 citations

    3

    h-index

1–5