{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:49:42Z","timestamp":1742964582386,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255090"},{"type":"electronic","value":"9783642255106"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25510-6_23","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:51:09Z","timestamp":1322643069000},"page":"266-277","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Magniez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Zeitoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. Journal of the ACM\u00a055(6) (2008)","DOI":"10.1145\/1455248.1455249"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Lenzner, P.: On approximate Nash equilibria in network design. In: Proc. of International Workshop on Internet and Network Economics, pp. 14\u201325 (2010)","DOI":"10.1007\/978-3-642-17572-5_2"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: Proc. of ACM Conference on Electronic Commerce, pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Proc. of IEEE Symposium on Foundations of Computer Science, pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Computing Nash equilibria: approximation and smoothed complexity. In: Proc. of IEEE Symposium on Foundations of Computer Science, pp. 603\u2013612 (2006)","DOI":"10.1109\/FOCS.2006.20"},{"key":"23_CR6","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in Congestion Games. In: Proc. of the ACM-SIAM Symposium on Discrete Algorithms, pp. 169\u2013178 (2007)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Proc. of Workshop on Internet and Network Economics, pp. 297\u2013306 (2006)","DOI":"10.1007\/11944874_27"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress in approximate Nash equilibria. In: Proc. of ACM Conference on Electronic Commerce, pp. 355\u2013358 (2007)","DOI":"10.1145\/1250910.1250962"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Proc. of ACM Symp. on Theory of Computing, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of ACM Symposium on Theory of Computing, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Feder, T., Nazerzadeh, H., Saberi, A.: Approximating Nash equilibria using small-support strategies. In: Proc. of ACM Conference on Electronic Commerce, pp. 352\u2013354 (2007)","DOI":"10.1145\/1250910.1250961"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Goemans, M., Li, L., Mirrokni, V., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: Proc. of ACM Symposium on Mobile Ad Hoc Networking and Computing, pp. 55\u201366 (2004)","DOI":"10.1145\/989459.989467"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D. Johnson","year":"1988","unstructured":"Johnson, D., Papadimitriou, C., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences\u00a037(1), 79\u2013100 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR14","unstructured":"Kearns, M., Mansour, Y.: Efficient Nash computation in large population games with bounded influence. In: Proc. of Conference on Uncertainty in Artificial Intelligence, pp. 259\u2013266 (2002)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proc. of ACM Conference on Electronic Commerce, pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N. Megiddo","year":"1991","unstructured":"Megiddo, N., Papadimitriou, C.: On total functions, existence theorems, and computational complexity. Theoretical Computer Science\u00a081, 317\u2013324 (1991)","journal-title":"Theoretical Computer Science"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential Games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. In: Proc. of ACM Symp. on Theory of Computing, pp. 229\u2013234 (1988)","DOI":"10.1145\/62212.62233"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Skopalik, E., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proc. of ACM Symposium on Theory of Computing, pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Tsaknakis, H., Spirakis, P.: An optimization approach for approximate Nash equilibria. In: Proc. of Workshop on Internet and Network Economics, pp. 42\u201356 (2007)","DOI":"10.1007\/978-3-540-77105-0_8"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25510-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:21:51Z","timestamp":1558297311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25510-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255090","9783642255106"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25510-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}