{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:19:35Z","timestamp":1787498375611,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540793083","type":"print"},{"value":"9783540793090","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_1","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T02:31:27Z","timestamp":1208572287000},"page":"1-3","source":"Crossref","is-referenced-by-count":1,"title":["The Search for Equilibrium Concepts"],"prefix":"10.1007","author":[{"given":"Christos H.","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aumann, R., Shapley, L.: Long-term Competition: A Game-theoretic Analysis, mimeo. Hebrew University (1976)"},{"key":"1_CR2","unstructured":"Chayes, J., Borgs, C., Immorlica, N., Kalai, A., Mirokhni, V., Papadimitriou, C.: The Myth of the Folk Theorem. In: STOC (to appear, 2008)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.: Computing Nash Equilibria: Approximation and Smoothed Complexity. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.20"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/11786986_45","volume-title":"Automata, Languages and Programming","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Fabrikant, A., Papadimitriou, C.H.: The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 513\u2013524. Springer, Heidelberg (2006)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The Complexity of Computing a Nash Equilibrium. In: STOC (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11944874_27","volume-title":"Internet and Network Economics","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A Note on Approximate Nash Equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 297\u2013306. Springer, Heidelberg (2006)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress in Approximate Nash Equilibria. In: EC (2007)","DOI":"10.1145\/1250910.1250962"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Papadimitriou, C.: Computing Equilibria in Anonymous Games. In: FOCS (2007)","DOI":"10.1109\/FOCS.2007.24"},{"key":"1_CR9","unstructured":"Fabrikant, A., Papadimitriou, C.H.: The Complexity of Game Dynamics: BGP Oscillations, Sink Equlibria, and Beyond. In: SODA (2008)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: STOC (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"1_CR11","unstructured":"Goemans, M., Mirrokni, V., Vetta, A.: Sink Equilibria and Convergence. In: FOCS (2005)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mehta, A.: Playing Large Games Using Simple Strategies. In: EC (2003)","DOI":"10.1145\/779928.779933"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Noncooperative Games. Annals of Mathematics\u00a054, 289\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Computing Correlated Equilibria in Multiplayer Games. In: STOC (2005)","DOI":"10.1145\/1060590.1060598"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Tsaknakis, H., Spirakis, P.: An Optimization Approach for Approximate Nash Equilibria. In: WINE (2007)","DOI":"10.1080\/15427951.2008.10129172"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T13:49:00Z","timestamp":1657547340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}