{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:58:01Z","timestamp":1794337081126,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309000","type":"print"},{"value":"9783540322931","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11600930_7","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T09:48:12Z","timestamp":1132825692000},"page":"55-69","source":"Crossref","is-referenced-by-count":29,"title":["Coordination Mechanisms for Selfish Scheduling"],"prefix":"10.1007","author":[{"given":"Nicole","family":"Immorlica","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM\u00a044(3) (1997)","DOI":"10.1145\/258128.258201"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y. Azar","year":"1995","unstructured":"Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. Journal of Algorithms\u00a018, 221\u2013237 (1995)","journal-title":"Journal of Algorithms"},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0009151","volume-title":"Stackelberg differential games in economic models","author":"A. Bagchi","year":"1984","unstructured":"Bagchi, A.: Stackelberg differential games in economic models. Springer, Heidelberg (1984)"},{"key":"7_CR4","unstructured":"Beckman, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/TNET.2005.850215","volume":"13","author":"S. Borst","year":"2005","unstructured":"Borst, S.: User-level performance of channel-aware scheduling algorithms in wireless data networks. IEEE\/ACM Transaction on Networking\u00a013(3), 636\u2013647 (2005)","journal-title":"IEEE\/ACM Transaction on Networking"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms, Turku, Finland, July 12-16, pp. 345\u2013357 (2004)","DOI":"10.1007\/978-3-540-27836-8_31"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: EC, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"7_CR8","unstructured":"Czumaj, A., Vocking, B.: Tight bounds for worst-case equilibria. In: SODA, pp. 413\u2013420 (2002)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1145\/322276.322284","volume":"28","author":"E. Davis","year":"1981","unstructured":"Davis, E., Jaffe, J.M.: Algorithms for scheduling tasks on unrelated processors. J. ACM\u00a028(4), 721\u2013736 (1981)","journal-title":"J. ACM"},{"key":"7_CR10","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)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT\u00a019, 312\u2013320 (1979)","journal-title":"BIT"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: FOCS, pp. 277\u2013285 (2004)","DOI":"10.1109\/FOCS.2004.69"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Gairing, M., Lucking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: STOC, pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1030194.1015478","volume":"34","author":"D.K. Goldenberg","year":"2004","unstructured":"Goldenberg, D.K., Qiu, L., Xie, H., Yang, Y.R., Zhang, Y.: Optimizing cost and performance for multihoming. SIGCOMM Comput. Commun. Rev.\u00a034(4), 79\u201392 (2004)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T. Gonzales","year":"1977","unstructured":"Gonzales, T., Ibarra, O., Sahni, S.: Bounds for lpt schedules on uniform processors. SIAM Journal of Computing\u00a06(1), 155\u2013166 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Bejerano, Y., Han, S.J., Li, L.: Fairness and load balancing in wireless LANs. In: Proceedings of the 9th annual international conference on Mobile computing and networking, MOBICOM (2004)","DOI":"10.1145\/1023720.1023751"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"O.H. Ibarra","year":"1977","unstructured":"Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM\u00a024(2), 280\u2013289 (1977)","journal-title":"J. ACM"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"Y.A. Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using Stackelberg routing strategies. IEEE\/ACM Transactions on Networking\u00a05(1), 161\u2013173 (1997)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: STACS, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J. Lenstra","year":"1990","unstructured":"Lenstra, J., Shmoys, D., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"7_CR21","unstructured":"Moulin, H.: On scheduling fees to prevent merging, splitting and transferring of jobs (May 2004)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium points in N-person games. In: Proceedings of NAS (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: STOC, pp. 104\u2013113 (2001)","DOI":"10.1145\/380752.380783"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"S. Sahni","year":"1980","unstructured":"Sahni, S., Cho, Y.: Bounds for list schedules on uniform processors. Siam J. of Computing\u00a09, 91\u2013103 (1980)","journal-title":"Siam J. of Computing"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-45535-3_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Schuurman","year":"2001","unstructured":"Schuurman, P., Vredeveld, T.: Performance guarantees of local search for multiprocessor scheduling. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 370\u2013382. Springer, Heidelberg (2001)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Suri, S., Toth, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures(SPAA), pp. 188\u2013195 (2004)","DOI":"10.1145\/1007912.1007941"},{"key":"7_CR28","volume-title":"Marktform und Gleichgewicht.","author":"H. Stackelberg von","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht. Springer, Heidelberg (1934); English translation entitled The Theory of the Market Economy"},{"key":"7_CR29","unstructured":"Vredeveld, T.: Combinatorial approximation algorithms. Guaranteed versus experimental performance, Ph.D. thesis (2002)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11600930_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:01:38Z","timestamp":1619492498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11600930_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309000","9783540322931"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11600930_7","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11600930","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}