{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:21:53Z","timestamp":1774034513519,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T00:00:00Z","timestamp":1210377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00182-008-0129-2","type":"journal-article","created":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T09:36:24Z","timestamp":1210325784000},"page":"475-504","source":"Crossref","is-referenced-by-count":25,"title":["Separable and low-rank continuous games"],"prefix":"10.1007","volume":"37","author":[{"given":"Noah D.","family":"Stein","sequence":"first","affiliation":[]},{"given":"Asuman","family":"Ozdaglar","sequence":"additional","affiliation":[]},{"given":"Pablo A.","family":"Parrilo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,10]]},"reference":[{"key":"129_CR1","volume-title":"Dynamic noncooperative game theory","author":"T Ba\u015far","year":"1999","unstructured":"Ba\u015far T, Olsder GJ (1999) Dynamic noncooperative game theory. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"129_CR2","volume-title":"Convex analysis and optimization","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas DP, Nedi\u0107 A, Ozdaglar AE (2003) Convex analysis and optimization. Athena Scientific, Belmont"},{"key":"129_CR3","volume-title":"Introduction to linear optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas D, Tsitsiklis JN (1997) Introduction to linear optimization. Athena Scientific, Belmont"},{"key":"129_CR4","unstructured":"Chen X, Deng X (2005) 3-Nash is PPAD-complete. Electronic colloquium on computational complexity. TR05-134"},{"key":"129_CR5","doi-asserted-by":"crossref","unstructured":"Chen X, Deng X (2006) Settling the complexity of two-player Nash equilibrium. In: Proceedings of the 47th annual IEEE symposium on foundations of computer science (FOCS)","DOI":"10.1109\/FOCS.2006.69"},{"key":"129_CR6","doi-asserted-by":"crossref","unstructured":"Daskalakis C, Goldberg PW, Papadimitriou CH (2006) The complexity of computing a Nash equilibrium. In: Proceedings of the 38th annual ACM symposium on theory of computing (STOC). ACM Press, New York, pp 71\u201378","DOI":"10.1145\/1132516.1132527"},{"key":"129_CR7","unstructured":"Daskalakis C, Papadimitriou CH (2005) Three-player games are hard. Electronic Colloquium on Computational Complexity. TR05-139"},{"key":"129_CR8","doi-asserted-by":"crossref","unstructured":"Dresher M, Karlin S (1953) Solutions of convex games as fixed points. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games II. Annals of Mathematics Studies, vol 28. Princeton University Press, pp 75\u201386","DOI":"10.1515\/9781400881970-005"},{"key":"129_CR9","first-page":"161","volume-title":"Contributions to the theory of games I. Annals of Mathematics Studies, vol 24","author":"M Dresher","year":"1950","unstructured":"Dresher M, Karlin S, Shapley LS (1950) Polynomial games. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games I. Annals of Mathematics Studies, vol 24. Princeton University Press, Princeton, pp 161\u2013180"},{"issue":"1","key":"129_CR10","first-page":"170","volume":"3","author":"IL Glicksberg","year":"1952","unstructured":"Glicksberg IL (1952) A further generalization of the Kakutani fixed point theorem, with application to Nash equilibrium points. Proc Am Math Soc 3(1): 170\u2013174","journal-title":"Proc Am Math Soc"},{"key":"129_CR11","unstructured":"Gross O (1952) A rational payoff characterization of the Cantor distribution. Technical Report D-1349, The RAND Corporation"},{"key":"129_CR12","unstructured":"Kannan R, Theobald T (2007) Games of fixed rank: A hierarchy of bimatrix games. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 1124\u20131132"},{"key":"129_CR13","volume-title":"Mathematical methods and theory in games, programming and economics, vol 2: theory of infinite games","author":"S Karlin","year":"1959","unstructured":"Karlin S (1959) Mathematical methods and theory in games, programming and economics, vol 2: theory of infinite games. Addison-Wesley, Reading"},{"key":"129_CR14","volume-title":"Geometry of moment spaces","author":"S Karlin","year":"1953","unstructured":"Karlin S, Shapley LS (1953) Geometry of moment spaces. American Mathematical Society, Providence"},{"key":"129_CR15","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 in bimatrix games. SIAM J Appl Math 12: 413\u2013423","journal-title":"SIAM J Appl Math"},{"key":"129_CR16","doi-asserted-by":"crossref","unstructured":"Lipton RJ, Markakis E, Mehta A (2003) Playing large games using simple strategies. In: Proceedings of the 4th ACM conference on electronic commerce. ACM Press, New York, pp 36\u201341","DOI":"10.1145\/779928.779933"},{"key":"129_CR17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S1574-0021(96)01004-0","volume-title":"Handbook of computational economics, vol 1","author":"RD McKelvey","year":"1996","unstructured":"McKelvey RD, McLennan A (1996) Computation of equilibria in finite games. In: Amman HM, Kendrick DA, Rust J (eds) Handbook of computational economics, vol 1. Elsevier, Amsterdam, pp 87\u2013142"},{"key":"129_CR18","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14: 124\u2013143","journal-title":"Games Econ Behav"},{"issue":"3","key":"129_CR19","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) On the complexity of the parity argument and other inefficient proofs of existence. J Comput Syst Sci 48(3): 498\u2013532","journal-title":"J Comput Syst Sci"},{"key":"129_CR20","doi-asserted-by":"crossref","unstructured":"Parrilo PA (2006) Polynomial games and sum of squares optimization. In: Proceedings of the 45th IEEE conference on decision and control (CDC)","DOI":"10.1109\/CDC.2006.377261"},{"key":"129_CR21","doi-asserted-by":"crossref","DOI":"10.1016\/B978-1-4832-0022-4.50006-5","volume-title":"Probability measures on metric spaces","author":"KR Parthasarathy","year":"1967","unstructured":"Parthasarathy KR (1967) Probability measures on metric spaces. Academic Press, New York"},{"key":"129_CR22","volume-title":"Functional analysis","author":"W Rudin","year":"1991","unstructured":"Rudin W (1991) Functional analysis. McGraw-Hill, New York"},{"key":"129_CR23","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"H Scarf","year":"1967","unstructured":"Scarf H (1967) The approximation of fixed points of a continuous mapping. SIAM J Appl Math 15: 1328\u20131343","journal-title":"SIAM J Appl Math"},{"key":"129_CR24","doi-asserted-by":"crossref","unstructured":"Stein ND (2007) Characterization and computation of equilibria in infinite games. Master\u2019s thesis, Massachusetts Institute of Technology","DOI":"10.1109\/CDC.2007.4434890"},{"key":"129_CR25","doi-asserted-by":"crossref","unstructured":"Stein ND, Parrilo PA, Ozdaglar A (2007) Characterization and computation of correlated equilibria in infinite games. In: Proceedings of the 46th IEEE conference on decision and control, pp 759\u2013764","DOI":"10.1109\/CDC.2007.4434890"},{"key":"129_CR26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"S Vavasis","year":"1992","unstructured":"Vavasis S (1992) Approximation algorithms for indefinite quadratic programming. Math Program 57: 279\u2013311","journal-title":"Math Program"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-008-0129-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-008-0129-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-008-0129-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:40:45Z","timestamp":1558622445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-008-0129-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,10]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s00182-008-0129-2","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,10]]}}}