Equilibrium Identification and Selection in Finite Games

References

• Aboolian R, Berman O, Krass D (2007) Competitive facility location and design problem. Eur. J. Oper. Res. 182:40–62.Crossref, Google Scholar
• Anderson E, Chen B, Shao L (2017) Supplier competition with option contracts for discrete blocks of capacity. Oper. Res. 65(4):952–967.Link, Google Scholar
• Aumann RJ (1990) Nash equilibria are not enforceable. Gabszewicz J, Richard JF, Wolsey L, eds. Economic Decision-Making: Games, Econometrics and Optimization (Elsevier, Amsterdam).Google Scholar
• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance H (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):293–432.Link, Google Scholar
• Beresnev V (2018) Competitive facility location and design problem. http://www.math.nsc.ru/AP/benchmarks/Design/design_en.html.Google Scholar
• Cachon GP, Zipkin PH (1999) Competitive and cooperative inventory policies in a two-stage supply chain. Management Sci. 45(7):936–953.Link, Google Scholar
• Carvalho M, Lodi A, Pedroso JP (2018) Existence of Nash equilibria on integer programming games. Springer Proceedings in Mathematics and Statistics, 223:11–23.Google Scholar
• Carvalho M, Lodi A, Pedroso JP (2022) Computing equilibria for integer programming games. Eur. J. Oper. Res. 303(3):1057–1070.Crossref, Google Scholar
• Carvalho M, Dragotto G, Lodi A, Sankaranarayanan S (2021) The cut and play algorithm: Computing Nash equilibria via outer approximations. Preprint, submitted November 10, https://arxiv.org/abs/2111.05726.Google Scholar
• Charness G, Feri F, Meléndez Jiménez MA, Sutter M (2014) Experimental games on networks: Underpinnings of behavior and equilibrium selection. Econometrica 82(5):1615–1670.Crossref, Google Scholar
• Dixit A (1980) The role of investment in entry-deterrence. Econom J. 90(357):95.Google Scholar
• Dobson G, Karmarkar US (1987) Competitive location on a network. Oper. Res. 35(4):565–574.Link, Google Scholar
• Dragotto G, Sankaranarayanan S, Carvalho M, Lodi A (2021) ZERO: Playing mathematical programming games. Preprint, submitted November 15, https://arxiv.org/abs/2111.07932.Google Scholar
• Drezner T, Drezner Z, Kalczynski P (2020) Gradual cover competitive facility location. OR Spectrum 42(2):333–354.Crossref, Google Scholar
• Facchinei F, Kanzow C (2007) Generalized Nash equilibrium problems. 4OR 5(3):173–210.Crossref, Google Scholar
• Federgruen A, Hu M (2015) Multi-product price and assortment competition. Oper. Res. 63(3):572–584.Link, Google Scholar
• Feldman M, Tamir T (2012) Conflicting congestion effects in resource allocation games. Oper. Res. 60(3):529–540.Link, Google Scholar
• Friesz TL, Bernstein D (2016) Nash Games. Complex Networks and Dynamic Systems 3: Foundations of Network Optimization and Games (Springer, Boston), 265–323.Crossref, Google Scholar
• Harsanyi J (1995) A new theory of equilibrium selection for games with complete information. Games Econom. Behav. 10(2):91–122.Crossref, Google Scholar
• Harsanyi J, Selten R (1988) A General Theory of Equilibrium Selection in Games (The MIT Press, Cambridge, MA).Google Scholar
• Hemmecke R, Onn S, Weismantel R (2009) Nash-equilibria and N-fold integer programming. Preprint, submitted March 26, http://arxiv.org/abs/0903.4577.Google Scholar
• Henk M, Richter-Gebert J, Ziegler GM (2017) Basic properties of convex polytopes. Goodman JE, O’Rourke J, Toth CD, eds. Handbook of Discrete and Computational Geometry, 3rd ed. (Chapman and Hall/CRC), 243–270.Google Scholar
• Huppmann D, Siddiqui S (2018) An exact solution method for binary equilibrium problems with compensation and the power market uplift problem. Eur. J. Oper. Res. 266(2):622–638.Crossref, Google Scholar
• Köppe M, Ryan CT, Queyranne M (2011) Rational generating functions and integer programming games. Oper. Res. 59(6):1445–1460.Link, Google Scholar
• Koutsoupias E, Papadimitriou C, Meinel C, Tison S, eds. (1999) Worst-Case Equilibria. STACS 99 (Springer Berlin Heidelberg, Berlin, Heidelberg), 404–413.Crossref, Google Scholar
• Lemke CE, Howson JT Jr (1964) Equilibrium points of bimatrix games. J. Soc. Indust. Appl. Math. 12(2):413–423.Crossref, Google Scholar
• Lippman SA, McCardle KF (1997) The competitive newsboy. Oper. Res. 45(1):54–65.Link, Google Scholar
• Muter I, Birbil SI, Bülbül K (2013) Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Math. Programming 142(1–2):47–82.Crossref, Google Scholar
• Myerson RB (1978) Refinements of the Nash equilibrium concept. Internat. J. Game Theory 7(2):73–80.Crossref, Google Scholar
• Nash J (1951) Non-cooperative games. Ann. Math. 54(2):286.Crossref, Google Scholar
• Netessine S, Shumsky RA (2005) Revenue management games: Horizontal and vertical competition. Management Sci. 51(5):813–831.Link, Google Scholar
• Nisan N, Roughgarden T, Tardos E, Varzirani VV, eds. (2007) Algorithmic Game Theory (Cambridge University Press).Crossref, Google Scholar
• Östling R, Tao-yi WJ, Chou EY, Camerer CF (2011) Testing game theory in the field: Swedish LUPI lottery games. Amer. Econom. J. Microeconom. 3(3):1–33.Crossref, Google Scholar
• Porter R, Nudelman E, Shoham Y (2004) Simple search methods for finding a Nash equilibrium. Proc. National Conf. Artificial Intelligence, 664–669.Google Scholar
• Röller LH, Tombak MM (1993) Competition and investment in flexible technologies. Management Sci. 39(1):107–114.Link, Google Scholar
• Sagratella S (2016) Computing all solutions of Nash equilibrium problems with discrete strategy sets. SIAM J. Optim. 26(4):2190–2218.Crossref, Google Scholar
• Sagratella S (2017a) Algorithms for generalized potential games with mixed-integer variables. Comput. Optim. Appl. 68(3):689–717.Crossref, Google Scholar
• Sagratella S (2017b) Computing equilibria of Cournot oligopoly models with mixed-integer quantities. Math. Methods Oper. Res. 86(3):549–565.Crossref, Google Scholar
• Sagratella S (2019) On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables. Optim. 68(1):197–226.Crossref, Google Scholar
• Sagratella S, Schmidt M, Sudermann-Merx N (2020) The noncooperative fixed charge transportation problem. Eur. J. Oper. Res. 284(1):373–382.Crossref, Google Scholar
• Sandholm T, Gilpin A, Conitzer V (2005) Mixed-integer programming methods for finding Nash equilibria. Proc. National Conf. Artificial Intelligence, 2:495–501.Google Scholar
• Selten R (1975) Reexamination of the perfectness concept for equilibrium points in extensive games. Internat. J. Game Theory 4(1):25–55.Crossref, Google Scholar
• Serra D, Marianov V, ReVelle C (1992) The maximum-capture hierarchical location problem. Eur. J. Oper. Res. 62(3):363–371.Crossref, Google Scholar
• Spence AM (1977) Entry, capacity, investment and oligopolistic pricing. Bell J. Econom. 8(2):534.Crossref, Google Scholar
• Stein ND, Ozdaglar A, Parrilo PA (2008) Separable and low-rank continuous games. Internat. J. Game Theory 37(4):475–504.Crossref, Google Scholar
• von Stengel B (2007) Equilibrium computation for two-player games in strategic and extensive form. Nisan N, Roughgarden T, Tardos E, Varzirani VV, eds. Algorithmic Game Theory (Cambridge University Press), 53–78.Crossref, Google Scholar