{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:12Z","timestamp":1725541812842},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_60","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"591-599","source":"Crossref","is-referenced-by-count":0,"title":["Mediated Equilibria in Load-Balancing Games"],"prefix":"10.1007","author":[{"given":"Joshua R.","family":"Davis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Liben-Nowell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexa","family":"Sharp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Wexler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Monderer, D., Tennenholtz, M.: Mediators in position auctions. In: EC 2007, pp. 279\u2013287 (2007)","DOI":"10.1145\/1250910.1250951"},{"issue":"1","key":"60_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1911154","volume":"55","author":"R. Aumann","year":"1987","unstructured":"Aumann, R.: Correlated equilibrium as an expression of Bayesian rationality. Econometrica\u00a055(1), 1\u201318 (1987)","journal-title":"Econometrica"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: STOC, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"60_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"key":"60_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: STOC 2005, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"1","key":"60_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A. Czumaj","year":"2007","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Trans. on Algorithms\u00a03(1), 4 (2007)","journal-title":"ACM Trans. on Algorithms"},{"key":"60_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"issue":"2","key":"60_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theoretical Computer Science\u00a0348(2), 226\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"60_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"issue":"7","key":"60_CR11","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1016\/j.jcss.2008.07.001","volume":"74","author":"M. Gairing","year":"2008","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci.\u00a074(7), 1199\u20131225 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"60_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/11523468_5","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., L\u00fccking, T., Monien, B., Tiemann, K.: Nash equilibria, the price of anarchy and the fully mixed Nash equilibrium conjecture. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 51\u201365. Springer, Heidelberg (2005)"},{"issue":"5","key":"60_CR13","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1111\/1468-0262.00153","volume":"68","author":"S. Hart","year":"2000","unstructured":"Hart, S., Mas-Colell, A.: A simple adaptive procedure leading to correlated equilibrium. Econometrica\u00a068(5), 1127\u20131150 (2000)","journal-title":"Econometrica"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Kakade, S., Kearns, M., Langford, J., Ortiz, L.: Correlated equilibria in graphical games. In: EC 2003, pp. 42\u201347 (2003)","DOI":"10.1145\/779928.779934"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Kothari, A., Suri, S., T\u00f3th, C., Zhou, Y.: Congestion games, load balancing, and price of anarchy. In: Workshop on Combinatorial and Algorithmic Aspects of Networking 2004 (2004)","DOI":"10.1007\/11527954_3"},{"key":"60_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563. Springer, Heidelberg (1999)"},{"issue":"3","key":"60_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2008.06.045","volume":"406","author":"T. L\u00fccking","year":"2008","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. Theoretical Computer Science\u00a0406(3), 187\u2013206 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"60_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M. Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. Algorithmica\u00a048(1), 91\u2013126 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"60_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.artint.2008.10.005","volume":"173","author":"D. Monderer","year":"2009","unstructured":"Monderer, D., Tennenholtz, M.: Strong mediated equilibrium. Artificial Intelligence\u00a0173(1), 180\u2013195 (2009)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"60_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1379759.1379762","volume":"55","author":"C. Papadimitriou","year":"2008","unstructured":"Papadimitriou, C., Roughgarden, T.: Computing equilibria in multi-player games. Journal of the ACM\u00a055(3), 1\u201329 (2008)","journal-title":"Journal of the ACM"},{"key":"60_CR21","unstructured":"Peleg, B., Procaccia, A.: Implementation by mediated equilibrium. Discussion paper 463, Center for the Study of Rationality, Hebrew University (2007)"},{"key":"60_CR22","unstructured":"Peleg, B., Procaccia, A.: Mediators and truthful voting. Working paper (2008)"},{"key":"60_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11944874_8","volume-title":"Internet and Network Economics","author":"O. Rozenfeld","year":"2006","unstructured":"Rozenfeld, O., Tennenholtz, M.: Strong and correlated strong equilibria in monotone congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 74\u201386. Springer, Heidelberg (2006)"},{"key":"60_CR24","unstructured":"Rozenfeld, O., Tennenholtz, M.: Routing mediators. In: IJCAI 2007 (2007)"},{"issue":"1","key":"60_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S. Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica\u00a047(1), 79\u201396 (2007)","journal-title":"Algorithmica"},{"key":"60_CR26","unstructured":"Tennenholtz, M.: Game-theoretic recommendations: Some progress in an uphill battle. In: Proc.\u00a0Intl.\u00a0Conf.\u00a0on Autonomous Agents and Multiagent Systems 2008 (2008)"},{"key":"60_CR27","volume-title":"Algorithmic Game Theory","author":"B. V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish load balancing. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:35:44Z","timestamp":1606185344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}