{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:31Z","timestamp":1725559471544},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_1","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"1-3","source":"Crossref","is-referenced-by-count":0,"title":["T\u03b1 \u03a0\u03b1\u03b9 \u03b4\u00ed \u03b1 \u03a0\u03b1\u00ed\u03b6\u03b5 \u03b9 The Interaction Between Algorithms and Game Theory"],"prefix":"10.1007","author":[{"given":"Christos H.","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The Complexity of Pure Nash equilibria. In: STOC (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"1_CR2","volume-title":"Theory of Learning in Games","author":"D. Fudenberg","year":"1998","unstructured":"Fudenberg, D., Levine, D.K.: Theory of Learning in Games. MIT Press, Cambridge (1998)"},{"key":"1_CR3","unstructured":"Kearns, M., Littman, M., Singh, S.: Graphical Models for Game Theory. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 253\u2013260 (2001)"},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E. Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-Server Conjecture. JACM\u00a042(5), 971\u2013983 (1995)","journal-title":"JACM"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C.E. Lemke","year":"1964","unstructured":"Lemke, C.E., Howson, J.T.: Equilibrium Points of Bimatrix Games. Journal of the Society of Industrial and Applied Mathematics\u00a012, 413\u2013423 (1964)","journal-title":"Journal of the Society of Industrial and Applied Mathematics"},{"key":"1_CR7","first-page":"87","volume-title":"The Handbook of Computation Economics","author":"R. McKelvey","year":"1996","unstructured":"McKelvey, R., McLennan, A.: Computation of Equilibria in Finite Games. In: Amman, H., Kendrick, D.A., Rust, J. (eds.) The Handbook of Computation Economics, vol.\u00a0I, pp. 87\u2013142. Elsevier, Amsterdam (1996)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N. Megiddo","year":"1978","unstructured":"Megiddo, N.: Computational Complexity of the Game Theory Approach to Cost Allocation on a Tree. Mathematics of Operations Research\u00a03, 189\u2013196 (1978)","journal-title":"Mathematics of Operations Research"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Computing Correlated Equilibria in Multiplayer Games. In: STOC (2005)","DOI":"10.1145\/1060590.1060598"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49, 2","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c3.: How Bad is Selfish Routing? JACM\u00a049, 2, 236\u2013259 (2002)","journal-title":"JACM"},{"key":"1_CR12","unstructured":"Savani, R., von Stengel, B.: Long Lemke-Howson Paths. In: FOCS (2004)"},{"key":"1_CR13","volume-title":"The Computation of Economic Equilibria","author":"H. Scarf","year":"1973","unstructured":"Scarf, H.: The Computation of Economic Equilibria. Yale University Press, New Haven (1973)"},{"key":"1_CR14","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On Complexity as Bounded Rationality (extended abstract). In: STOC, pp. 726\u2013733 (1994)","DOI":"10.1145\/195058.195445"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:00:15Z","timestamp":1558296015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11427186_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}