{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:34:26Z","timestamp":1774046066203,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,10]],"date-time":"2014-04-10T00:00:00Z","timestamp":1397088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10287-014-0206-x","type":"journal-article","created":{"date-parts":[[2014,4,9]],"date-time":"2014-04-09T16:18:58Z","timestamp":1397060338000},"page":"5-33","source":"Crossref","is-referenced-by-count":25,"title":["Game Theory Explorer: software for the applied game theorist"],"prefix":"10.1007","volume":"12","author":[{"given":"Rahul","family":"Savani","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"von Stengel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,10]]},"reference":[{"key":"206_CR1","doi-asserted-by":"crossref","unstructured":"Audet C, Belhaiza S, Hansen P (2009) A new sequence form approach for the enumeration of all extreme Nash equilibria for extensive form games. Int Game Theory Rev 11:437\u2013451","DOI":"10.1142\/S021919890900242X"},{"key":"206_CR2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/S1064827598339086","volume":"23","author":"C Audet","year":"2001","unstructured":"Audet C, Hansen P, Jaumard B, Savard G (2001) Enumeration of all extreme equilibria of bimatrix games. SIAM J Sci Comput 23:323\u2013338","journal-title":"SIAM J Sci Comput"},{"key":"206_CR3","doi-asserted-by":"crossref","unstructured":"Avis D (2000) Lrs: a revised implementation of the reverse search vertex enumeration algorithm. In: Kalai G, Ziegler G (eds) Polytopes-combinatorics and computation. DMV Seminar Band 29. Birkh\u00e4user, Basel, pp 177\u2013198","DOI":"10.1007\/978-3-0348-8438-9_9"},{"key":"206_CR4","unstructured":"Avis D (2006) User\u2019s guide for lrs. http:\/\/cgm.cs.mcgill.ca\/~avis . Accessed 2 April 2014"},{"key":"206_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s00199-009-0449-x","volume":"42","author":"D Avis","year":"2010","unstructured":"Avis D, Rosenberg G, Savani R, von Stengel B (2010) Enumeration of Nash equilibria for two-player games. Econ Theory 42:9\u201337","journal-title":"Econ Theory"},{"key":"206_CR6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0899-8256(05)80001-6","volume":"8","author":"K Bagwell","year":"1995","unstructured":"Bagwell K (1995) Commitment and observability in games. Games Econ Behav 8:271\u2013280","journal-title":"Games Econ Behav"},{"key":"206_CR7","unstructured":"Balthasar AV (2009) Geometry and equilibria in bimatrix games. PhD Thesis, London School of Economics, London"},{"key":"206_CR8","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1038\/467753a","volume":"467","author":"N Barnes","year":"2010","unstructured":"Barnes N (2010) Publish your computer code: it is good enough. Nature 467:753\u2013753","journal-title":"Nature"},{"key":"206_CR9","unstructured":"Belhaiza SJ, Mve AD, Audet C (2010) XGame-solver software. http:\/\/faculty.kfupm.edu.sa\/MATH\/slimb\/XGame-Solver-Webpage\/index.htm . Accessed 2 April 2014"},{"key":"206_CR10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16:575\u2013577","journal-title":"Commun ACM"},{"key":"206_CR11","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","volume":"63","author":"V Conitzer","year":"2008","unstructured":"Conitzer V, Sandholm T (2008) New complexity results about Nash equilibria. Games Econ Behav 63:621\u2013641","journal-title":"Games Econ Behav"},{"key":"206_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s00199-009-0447-z","volume":"42","author":"RS Datta","year":"2010","unstructured":"Datta RS (2010) Finding all Nash equilibria of a finite game using polynomial algebra. Econ Theory 42:55\u201396","journal-title":"Econ Theory"},{"key":"206_CR13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I Gilboa","year":"1989","unstructured":"Gilboa I, Zemel E (1989) Nash and correlated equilibria: some complexity considerations. Games Econ Behav 1:80\u201393","journal-title":"Games Econ Behav"},{"key":"206_CR14","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/S0165-1889(03)00108-8","volume":"28","author":"S Govindan","year":"2004","unstructured":"Govindan S, Wilson R (2004) Computing Nash equilibria by iterated polymatrix approximation. J Econ Dyn Control 28:1229\u20131241","journal-title":"J Econ Dyn Control"},{"key":"206_CR15","volume-title":"A general theory of equilibrium selection in games","author":"JC Harsanyi","year":"1988","unstructured":"Harsanyi JC, Selten R (1988) A general theory of equilibrium selection in games. MIT Press, Cambridge"},{"key":"206_CR16","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jeth.2001.2856","volume":"106","author":"E Hauk","year":"2002","unstructured":"Hauk E, Hurkens S (2002) On forward induction and evolutionary and strategic stability. J Econ Theory 106:66\u201390","journal-title":"J Econ Theory"},{"key":"206_CR17","unstructured":"Huang W (2011) Equilibrium computation for extensive games. PhD Thesis, London School of Economics, London"},{"key":"206_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.geb.2010.10.012","volume":"71","author":"AX Jiang","year":"2011","unstructured":"Jiang AX, Leyton-Brown K, Bhat NAR (2011) Action-graph games. Games Econ Behav 71:141\u2013173","journal-title":"Games Econ Behav"},{"key":"206_CR19","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.2307\/1912320","volume":"54","author":"E Kohlberg","year":"1986","unstructured":"Kohlberg E, Mertens J-F (1986) On the strategic stability of equilibria. Econometrica 54:1003\u20131037","journal-title":"Econometrica"},{"key":"206_CR20","first-page":"193","volume-title":"Annals of mathematics studies","author":"HW Kuhn","year":"1953","unstructured":"Kuhn HW (1953) Extensive games and the problem of information. Contributions to the theory of games II. In: Kuhn HW, Tucker AW (eds) Annals of mathematics studies, 28th edn. Princeton University Press, Princeton, pp 193\u2013216","edition":"28"},{"key":"206_CR21","unstructured":"Langlois J-P (2006) GamePlan, a windows application for representing and solving games. http:\/\/userwww.sfsu.edu\/langlois\/ . Accessed 2 April 2014"},{"key":"206_CR22","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"CE Lemke","year":"1965","unstructured":"Lemke CE (1965) Bimatrix equilibrium points and mathematical programming. Manag Sci 11:681\u2013689","journal-title":"Manag Sci"},{"key":"206_CR23","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"CE Lemke","year":"1964","unstructured":"Lemke CE, Howson JT Jr (1964) Equilibrium points of bimatrix games. J Soc Ind Appl Math 12:413\u2013423","journal-title":"J Soc Ind Appl Math"},{"key":"206_CR24","unstructured":"McKelvey RD, McLennan AM, Turocy TL (2010) Gambit: software tools for game theory, version 0.2010.09.01. http:\/\/www.gambit-project.org . Accessed 2 April 2014"},{"key":"206_CR25","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash J (1951) Noncooperative games. Ann Math 54:286\u2013295","journal-title":"Ann Math"},{"key":"206_CR26","volume-title":"An introduction to game theory","author":"MJ Osborne","year":"2004","unstructured":"Osborne MJ (2004) An introduction to game theory. Oxford University Press, Oxford"},{"key":"206_CR27","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01263276","volume":"26","author":"T Quint","year":"1997","unstructured":"Quint T, Shubik M (1997) A theorem on the number of Nash equilibria in a bimatrix game. Int J Game Theory 26:353\u2013359","journal-title":"Int J Game Theory"},{"key":"206_CR28","unstructured":"Savani R (2005) Solve a bimatrix game. Interactive website. http:\/\/banach.lse.ac.uk\/ . Accessed 2 April 2014"},{"key":"206_CR29","doi-asserted-by":"crossref","unstructured":"Savani R, von Stengel B (2004) Exponentially many steps for finding a Nash equilibrium in a bimatrix game. In: CDAM research report LSE-CDAM-2004-03","DOI":"10.1109\/FOCS.2004.28"},{"key":"206_CR30","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1111\/j.1468-0262.2006.00667.x","volume":"74","author":"R Savani","year":"2006","unstructured":"Savani R, von Stengel B (2006) Hard-to-solve bimatrix games. Econometrica 74:397\u2013429","journal-title":"Econometrica"},{"key":"206_CR31","doi-asserted-by":"crossref","unstructured":"Shapley LS (1974) A note on the Lemke\u2013Howson algorithm. In: Mathematical programming study 1: pivoting and extensions, pp 175\u2013189","DOI":"10.1007\/BFb0121248"},{"key":"206_CR32","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/moor.12.3.377","volume":"12","author":"G Laan van der","year":"1987","unstructured":"van der Laan G, Talman AJJ, van der Heyden L (1987) Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling. Math Oper Res 12:377\u2013397","journal-title":"Math Oper Res"},{"key":"206_CR33","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1006\/game.1996.0050","volume":"14","author":"B Stengel von","year":"1996","unstructured":"von Stengel B (1996) Efficient computation of behavior strategies. Games Econ Behav 14:220\u2013246","journal-title":"Games Econ Behav"},{"key":"206_CR34","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/PL00009438","volume":"21","author":"B Stengel von","year":"1999","unstructured":"von Stengel B (1999) New maximal numbers of equilibria in bimatrix games. Discret Comput Geom 21:557\u2013568","journal-title":"Discret Comput Geom"},{"key":"206_CR35","first-page":"1723","volume-title":"Handbook of game theory","author":"B Stengel von","year":"2002","unstructured":"von Stengel B (2002) Computing equilibria for two-person games. In: Aumann RJ, Hart S (eds) Handbook of game theory, vol 3. North-Holland, Amsterdam, pp 1723\u20131759"},{"key":"206_CR36","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/CBO9780511800481.005","volume-title":"Algorithmic game theory","author":"B Stengel von","year":"2007","unstructured":"von Stengel B et al (2007) Equilibrium computation for two-player games in strategic and extensive form. In: Nisan N (ed) Algorithmic game theory. Cambridge University Press, Cambridge, pp 53\u201378"},{"key":"206_CR37","unstructured":"von Stengel B (2012) Rank-1 games with exponentially many Nash equilibria. Preprint. arXiv:1211.2405"},{"key":"206_CR38","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1111\/1468-0262.00300","volume":"70","author":"B Stengel von","year":"2002","unstructured":"von Stengel B, van den Elzen AH, Talman AJJ (2002) Computing normal form perfect equilibria for extensive two-person games. Econometrica 70:693\u2013715","journal-title":"Econometrica"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-014-0206-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-014-0206-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-014-0206-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T06:56:21Z","timestamp":1565333781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-014-0206-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,10]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["206"],"URL":"https:\/\/doi.org\/10.1007\/s10287-014-0206-x","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,10]]}}}