Existence of Nash Equilibria on Integer Programming Games
- 833 Downloads
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.
KeywordsInteger programming games Nash equilibria Computational complexity
Part of this work was performed while the first author was in the Faculty of Sciences University of Porto and INESC TEC. The first author thanks the support of Institute for data valorisation (IVADO), the Portuguese Foundation for Science and Technology (FCT) through a PhD grant number SFRH/BD/79201/2011 and the ERDF European Regional Development Fund through the Operational Programme for Competitiveness and Internationalisation - COMPETE 2020 Programme within project POCI-01-0145-FEDER-006961, and National Funds through the FCT (Portuguese Foundation for Science and Technology) as part of project UID/EEA/50014/2013. We thank the referees for comments and questions that helped clarifying the presentation.
- 2.M. Carvalho, Computation of equilibria on integer programming games, Ph.D. thesis, Faculdade de Ciências da Universidade do Porto (2016)Google Scholar
- 4.X. Chen, X. Deng, Settling the complexity of two-player nash equilibrium. in 47th Annual IEEE Symposium on Foundations of Computer Science, 2006. FOCS ’06 (2006), pp. 261–272. https://doi.org/10.1109/FOCS.2006.69
- 10.M.M. Kostreva, Combinatorial optimization in nash games. Comput. Math. Appl. 25(10–11), 27–34 (1993), URL http://www.sciencedirect.com/science/article/pii/0898122193902784. https://doi.org/10.1016/0898-1221(93)90278-4. ISSN 0898-1221
- 11.H. Li, J. Meissner, Competition under capacitated dynamic lot-sizing with capacity acquisition. Int. J. Prod. Econ. 131(2), 535–544 (2011), URL http://www.sciencedirect.com/science/article/pii/S0925527311000375. https://doi.org/10.1016/j.ijpe.2011.01.022. ISSN 0925-5273.
- 12.R.D. Mckelvey, A.M. Mclennan, T.L. Turocy, Gambit: software tools for game theory. Version 16.0.0 (2016), http://www.gambit-project.org