Existence of Nash Equilibria on Integer Programming Games

We aim to investigate a new class of games, where each player’s set of strategies is a union of polyhedra. These are called integer programming games. To motivate our work, we describe some practical examples suitable to be modeled under this paradigm. We analyze the problem of determining whether or not a Nash equilibria exists for an integer programming game, and demonstrate that it is complete for the second level of the polynomial hierarchy.

[1]  Maria Margarida da Silva Carvalho,et al.  Computation of equilibria on integer programming games , 2016 .

[2]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[3]  I. Glicksberg.  A FURTHER GENERALIZATION OF THE KAKUTANI FIXED POINT THEOREM, WITH APPLICATION TO NASH EQUILIBRIUM POINTS , 1952 .

[4]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering) , 2006 .

[5]  Hongyan Li,et al.  Competition under capacitated dynamic lot-sizing with capacity acquisition , 2011 .

[6]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[7]  S. Gabriel,et al.  Solving Discretely-Constrained Nash–Cournot Games with an Application to Power Markets , 2013 .

[8]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[9]  Bernhard von Stengel,et al.  Computation of Nash equilibria in finite games: introduction to the symposium , 2010 .

[10]  S. Granville,et al.  Strategic bidding under uncertainty: a binary expansion approach , 2005, IEEE Transactions on Power Systems.

[11]  M. Kostreva.  Combinatorial optimization in nash games , 1993 .

[12]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[13]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[14]  Avrim Blum,et al.  Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.

[15]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[16]  W. Karush.  Minima of Functions of Several Variables with Inequalities as Side Conditions , 2014 .

[17]  Gerhard J. Woeginger,et al.  A Study on the Computational Complexity of the Bilevel Knapsack Problem , 2014, SIAM J. Optim..

[18]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[19]  Augustin M. Cournot.  Cournot, Antoine Augustin: Recherches sur les principes mathématiques de la théorie des richesses , 2019, Die 100 wichtigsten Werke der Ökonomie.

[20]  Andrea Lodi,et al.  Nash equilibria in the two-player kidney exchange game , 2017, Math. Program..

[21]  Maurice Queyranne,et al.  Rational Generating Functions and Integer Programming Games , 2008, Oper. Res..

[22]  Asuman E. Ozdaglar,et al.  Separable and low-rank continuous games , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[23]  Andrew McLennan,et al.  Gambit: Software Tools for Game Theory , 2006 .

[24]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).