[18] Gurobi. Non-convex quadratic optimization. https://pages.gurobi.com/rs/181-ZYS-005/images/2020-01-14_Non%20Convex%20Quadratic%20Optimization%20in%20Gurobi%209.0%20Webinar.pdf, 2020. Accessed: 2021-09-20.
[19] Gurobi. Gurobi optimizer reference manual. https://www.gurobi.com/documentation/9.1/ refman/index.html, 2021. Accessed: 2021-09-20.
[20] Donald E Knuth. The Art of Computer Programming. Fundamental Algorithms, 3rd edition, volume 1, 1997.
[21] Scott Kolodziej, Pedro M Castro, and Ignacio E Grossmann. Global optimization of bilinear programs with a multiparametric disaggregation technique. Journal of Global Optimization, 57(4):1039-1063, 2013.
[22] Marc Lanctot, Vinicius Zambaldi, Audrunas Gruslys, Angeliki Lazaridou, Karl Tuyls, Julien Pérolat, David Silver, and Thore Graepel. A unified game-theoretic approach to multiagent reinforcement learning. In NeurIPS, pages 4190–4203, 2017.
[23] Shuxin Li, Xinrun Wang, Youzhi Zhang, Wanqi Xue, Jakub Černý, and Bo An. Solving large-scale pursuit- evasion games using pre-trained strategies. In AAAI, volume 37, pages 11586–11594, 2023.
[24] Shuxin Li, Youzhi Zhang, Xinrun Wang, Wanqi Xue, and Bo An. CFR-MIX: Solving imperfect information extensive-form games with combinatorial action space. In *IJCAI*, pages 3663-3669, 2021.
[25] Leo Liberti. Linearity embedded in nonconvex programs. Journal of Global Optimization, 33(2):157-196, 2005.
[26] Sara Marie McCarthy, Milind Tambe, Christopher Kiekintveld, Meredith L Gore, and Alex Killion. Preventing illegal logging: Simultaneous optimization of resource teams and tactics for security. In AAAI, pages 3880-3886, 2016.
[27] Garth P McCormick. Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems. Mathematical Programming, 10(1):147-175, 1976.
[28] Richard D. McKelvey, Andrew M. McLennan, and Theodore L. Turocy. Gambit: Software tools for game theory, version 16.0.1. http://www.gambit-project.org, 2014.
[29] Richard D McKelvey and Thomas R Palfrey. Quantal response equilibria for normal form games. Games and Economic Behavior, 10(1):6-38, 1995.
[30] John Nash. Non-cooperative games. Annals of Mathematics, pages 286-295, 1951.
[31] Eugene Nudelman, Jennifer Wortman, Yoav Shoham, and Kevin Leyton-Brown. Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms. In AAMAS, volume 4, pages 880-887, 2004.
[32] Christos H Papadimitriou. On the complexity of integer programming. Journal of the ACM (JACM), 28(4):765-768, 1981.
[33] Stuart J Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Malaysia; Pearson Education Limited, 2016.
[34] Tuomas Sandholm, Andrew Gilpin, and Vincent Conitzer. Mixed-integer programming methods for finding Nash equilibria. In AAAI, pages 495–501, 2005.
[35] Hanif D Sherali and Amine Alameddine. A new reformulation-linearization technique for bilinear programming problems. Journal of Global Optimization, 2(4):379-410, 1992.
[36] Hanif D Sherali, Evrim Dalkiran, and Leo Liberti. Reduced RLT representations for nonconvex polynomial programming problems. Journal of Global Optimization, 52(3):447-469, 2012.
[37] Yoav Shoham and Kevin Leyton-Brown. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, 2008.