{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:02Z","timestamp":1767339542590,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"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_24","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"267-278","source":"Crossref","is-referenced-by-count":19,"title":["Approximate Nash Equilibria for Multi-player Games"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"H\u00e9mon","sequence":"first","affiliation":[]},{"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Bosse, H., Byrka, J., Markakis, E.: New algorithms for approximate Nash equilibria in bimatrix games. In: International Workshop on Internet and Network Economics (2008)"},{"key":"24_CR2","unstructured":"Chen, X., Deng, X.: 3-NASH is PPAD-complete. Electronic Colloquium in Computational Complexity\u00a0(134) (2005)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Computing Nash equilibria: approximation and smoothed complexity. In: IEEE Symposium On Foundations of Computer Science, pp. 603\u2013612 (2006)","DOI":"10.1109\/FOCS.2006.20"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: IEEE Symposium on Foundations of Computer Science, pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"24_CR5","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: ACM-SIAM Symposium On Discrete Algorithms, pp. 169\u2013178 (2007)"},{"key":"24_CR6","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: Three players games are hard. Electronic Colloquium on Computational Complexity\u00a0(139) (2005)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: ACM Symposium on Theory of Computing, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: International Workshop on Internet and Network Economics, pp. 297\u2013306 (2006)","DOI":"10.1007\/11944874_27"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress in approximate Nash equilibria. In: ACM Conference on Electronic Commerce, pp. 355\u2013358 (2007)","DOI":"10.1145\/1250910.1250962"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Feder, T., Nazerzadeh, H., Saberi, A.: Approximating Nash equilibria using small-support strategies. In: ACM Conference on Electronic Commerce, pp. 352\u2013354 (2007)","DOI":"10.1145\/1250910.1250961"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Lemke, C.E., Howson Jr., J.T.: Equilibrium points of bimatrix games. Journal of the Society of Industrial and Applied Mathematics, 413\u2013423 (1964)","DOI":"10.1137\/0112033"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: ACM Conference on Electronic Commerce, pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"24_CR13","first-page":"148","volume-title":"Surveys in combinatorics, London Math. Soc. Lectures Notes","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in combinatorics, London Math. Soc. Lectures Notes, vol.\u00a0141, pp. 148\u2013188. Cambridge Univ. Press, Cambridge (1989)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Annals of mathematics\u00a054, 286\u2013295 (1951)","journal-title":"Annals of mathematics"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Savani, R., von Stengel, B.: Exponentially many steps for finding a Nash equilibrium in a bimatrix game. In: IEEE Symposium on Foundations Of Computer Science, pp. 258\u2013267 (2004)","DOI":"10.1109\/FOCS.2004.28"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Tsaknakis, H., Spirakis, P.: An optimization approach for approximate Nash equilibria. In: International Workshop on Internet and Network Economics, pp. 42\u201356 (2008)","DOI":"10.1007\/978-3-540-77105-0_8"}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T20:32:32Z","timestamp":1738182752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}