{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:07:48Z","timestamp":1773965268289,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642353109","type":"print"},{"value":"9783642353116","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_26","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T02:32:28Z","timestamp":1354588348000},"page":"350-363","source":"Crossref","is-referenced-by-count":10,"title":["Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games"],"prefix":"10.1007","author":[{"given":"Johanne","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Kim","family":"Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Abed, F., Huang, C.-C.: Preemptive coordination mechanisms for unrelated machines. In: Proc. of the 20th European Symposium on Algorithms (2012)","DOI":"10.1007\/978-3-642-33090-2_3"},{"key":"26_CR2","unstructured":"Azar, Y., Jain, K., Mirrokni, V.S. (Almost) optimal coordination mechanisms for unrelated machine scheduling. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 323\u2013332 (2008)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-15781-3_2","volume-title":"Algorithms \u2013 ESA 2010","author":"K. Bhawalkar","year":"2010","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 17\u201328. Springer, Heidelberg (2010)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 815\u2013824 (2009)","DOI":"10.1137\/1.9781611973068.89"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V.S., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: Proc. of the ACM Symposium on Theory of Computing, pp. 539\u2013548 (2011)","DOI":"10.1145\/1993636.1993708"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Svitkina, Z.: Preference-constrained oriented matching. In: Workshop on Analytic Algorithmics and Combinatorics, pp. 56\u201365 (2010)","DOI":"10.1137\/1.9781611973006.9"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-33996-7_18","volume-title":"Algorithmic Game Theory","author":"L. Gourv\u00e8s","year":"2012","unstructured":"Gourv\u00e8s, L., Monnot, J., Moretti, S., Thang, N.K.: Congestion Games with Capacitated Resources. In: Serna, M. (ed.) SAGT 2012. LNCS, vol.\u00a07615, pp. 204\u2013215. Springer, Heidelberg (2012)"},{"issue":"17","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N. Immorlica","year":"2009","unstructured":"Immorlica, N., Li, L(E.), Mirrokni, V.S., Schulz, A.S.: Coordination mechanisms for selfish scheduling. Theor. Comput. Sci.\u00a0410(17), 1589\u20131598 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR10","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.S.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: 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":"26_CR12","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proc. of the ACM Symposium on Theory of Computing, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Schoppmann, F.: Local smoothness and the price of anarchy in atomic splittable congestion games. In: Proc. of the ACM-SIAM Symposium on Discrete Algorithms (2011)","DOI":"10.1137\/1.9781611973082.22"},{"key":"26_CR14","unstructured":"Silberschatz, A., Galvin, P.: Operating System Concepts. Addison-Wesley (1994)"},{"issue":"1","key":"26_CR15","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.D., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica\u00a047(1), 79\u201396 (2007)","journal-title":"Algorithmica"},{"key":"26_CR16","unstructured":"Tanenbaum, A.S.: Modern Operating Systems. Prentice Hall Press (2007)"}],"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-35311-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:29:41Z","timestamp":1558301381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}