{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:58:38Z","timestamp":1743055118946,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238616"},{"type":"electronic","value":"9783319238623"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23862-3_49","type":"book-chapter","created":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T14:06:06Z","timestamp":1444745166000},"page":"499-507","source":"Crossref","is-referenced-by-count":1,"title":["A New Method to Finding All Nash Equilibria"],"prefix":"10.1007","author":[{"given":"Zhengtian","family":"Wu","sequence":"first","affiliation":[]},{"given":"Chuangyin","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Fuyuan","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Baochuan","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"issue":"2","key":"49_CR1","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"JF Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a nash equilibrium. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player nash equilibrium. In: Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS), pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"issue":"2","key":"49_CR4","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"CE Lemke","year":"1964","unstructured":"Lemke, C.E., Howson, J.T.: Equilibrium points of bimatrix games. J. Soc. Ind. Appl. Math. 12(2), 413\u2013423 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"49_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1137\/0121011","volume":"21","author":"R Wilson","year":"1971","unstructured":"Wilson, R.: Computing equilibria of n-person games. SIAM J. Appl. Math. 21(1), 80\u201387 (1971)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"49_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0121010","volume":"21","author":"J Rosenm\u00fcller","year":"1971","unstructured":"Rosenm\u00fcller, J.: On a generalization of the lemke-howson algorithm to noncooperative n-person games. SIAM J. Appl. Math. 21(1), 73\u201379 (1971)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. Nat. Acad. Sci. 36(1), 48\u201349 (1950)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"5","key":"49_CR8","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"HE Scarf","year":"1967","unstructured":"Scarf, H.E.: The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math. 15(5), 1328\u20131343 (1967)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"49_CR9","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/moor.16.1.148","volume":"16","author":"C Dang","year":"1991","unstructured":"Dang, C.: The D1-triangulation of Rn for simplicial algorithms for computing solutions of nonlinear equations. Math. Oper. Res. 16(1), 148\u2013161 (1991)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"49_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0377-0427(00)00427-1","volume":"124","author":"EL Allgower","year":"2000","unstructured":"Allgower, E.L., Georg, K.: Piecewise linear methods for nonlinear equations and optimization. J. Comput. Appl. Math. 124(1), 245\u2013261 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/B978-0-12-358350-5.50011-7","volume":"4","author":"CB Garcia","year":"1973","unstructured":"Garcia, C.B., Lemke, C.E., Luethi, H.: Simplicial approximation of an equilibrium point of noncooperative n-person games. Math. Program. 4, 227\u2013260 (1973)","journal-title":"Math. Program."},{"issue":"3","key":"49_CR12","doi-asserted-by":"publisher","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, A.J.J., Van der Heyden, L.: Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling. Math. Oper. Res. 12(3), 377\u2013397 (1987)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"49_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF02591741","volume":"37","author":"TM Doup","year":"1987","unstructured":"Doup, T.M., Talman, A.J.J.: A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices. Math. Program. 37(3), 319\u2013355 (1987)","journal-title":"Math. Program."},{"issue":"2","key":"49_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01766187","volume":"4","author":"JC Harsanyi","year":"1975","unstructured":"Harsanyi, J.C.: The tracing procedure: a bayesian approach to defining a solution for n-person noncooperative games. Int. J. Game Theor. 4(2), 61\u201394 (1975)","journal-title":"Int. J. Game Theor."},{"issue":"1","key":"49_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01415958","volume":"35","author":"AH Elzen Van den","year":"1991","unstructured":"Van den Elzen, A.H., Talman, A.J.J.: A procedure for finding nash equilibria in bi-matrix games. Math. Methods Oper. Res. 35(1), 27\u201343 (1991)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"49_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/game.2001.0856","volume":"38","author":"PJJ Herings","year":"2002","unstructured":"Herings, P.J.J., Van den Elzen, A.: Computation of the nash equilibrium selected by the tracing procedure in n-person games. Game Econ. Behav. 38(1), 89\u2013117 (2002)","journal-title":"Game Econ. Behav."},{"key":"49_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S1574-0021(96)01004-0","volume":"1","author":"RD McKelvey","year":"1996","unstructured":"McKelvey, R.D., McLennan, A.: Computation of equilibria in finite games. Handb. Comput. Econ. 1, 87\u2013142 (1996)","journal-title":"Handb. Comput. Econ."},{"key":"49_CR18","first-page":"1723","volume":"3","author":"B Stengel Von","year":"2002","unstructured":"Von Stengel, B.: Computing equilibria for two-person games. Handb. game Theor. Econ. Appl. 3, 1723\u20131759 (2002)","journal-title":"Handb. game Theor. Econ. Appl."},{"issue":"6\u20137","key":"49_CR19","first-page":"135","volume":"21","author":"MM Kosrnnva","year":"1991","unstructured":"Kosrnnva, M.M., Kinard, L.A.: A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games. Comput. Math. Appl. 21(6\u20137), 135\u2013143 (1991)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"49_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10479-005-2265-4","volume":"137","author":"PJJ Herings","year":"2005","unstructured":"Herings, P.J.J., Peeters, R.J.A.P.: A globally convergent algorithm to compute all nash equilibria for n-person games. Ann. Oper. Res. 137(1), 349\u2013368 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"49_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00199-009-0447-z","volume":"42","author":"RS Datta","year":"2010","unstructured":"Datta, R.S.: Finding all nash equilibria of a finite game using polynomial algebra. Econ. Theor. 42(1), 55\u201396 (2010)","journal-title":"Econ. Theor."},{"key":"49_CR22","unstructured":"Sandholm, T., Gilpin, A., Conitzer, V.: Mixed-integer programming methods for finding nash equilibria. In: Proceedings of the National Conference on Artificial Intelligence, pp. 495\u2013501 (2005)"},{"issue":"1","key":"49_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00199-009-0449-x","volume":"42","author":"D Avis","year":"2010","unstructured":"Avis, D., Rosenberg, G.D., Savani, R., Von Stengel, B.: Enumeration of nash equilibria for two-player games. Econ. Theor. 42(1), 9\u201337 (2010)","journal-title":"Econ. Theor."},{"key":"49_CR24","doi-asserted-by":"crossref","unstructured":"Wu, Z., Dang, C., Karimi, H.R., Zhu, C., Gao, Q.: A mixed 0-1 linear programming approach to the computation of all pure-strategy nash equilibria of a finite n-person game in normal form. Mathematical Problems in Engineering, vol. 2014, p. 8 (2014)","DOI":"10.1155\/2014\/640960"},{"issue":"2","key":"49_CR25","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-012-0606-z","volume":"136","author":"J Luedtke","year":"2012","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2), 325\u2013351 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"49_CR26","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"FA Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273\u2013286 (1983)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23862-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:36:16Z","timestamp":1559266576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23862-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238616","9783319238623"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23862-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}