{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:46:12Z","timestamp":1767339972789},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046445"},{"type":"electronic","value":"9783642046452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_13","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"135-146","source":"Crossref","is-referenced-by-count":11,"title":["Non-clairvoyant Scheduling Games"],"prefix":"10.1007","author":[{"given":"Christoph","family":"D\u00fcrr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim Thang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.tcs.2006.07.057","volume":"369","author":"E. Angel","year":"2006","unstructured":"Angel, E., Bampis, E., Pascual, F.: Truthful algorithms for scheduling selfish tasks on parallel machines. Theoretical Computer Science (TCS)\u00a0369, 157\u2013168 (2006)","journal-title":"Theoretical Computer Science (TCS)"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM\u00a044(3), 486\u2013504 (1997)","journal-title":"Journal of the ACM"},{"issue":"2-3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.05.010","volume":"361","author":"B. Awerbuch","year":"2006","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., Tsur, D.: Tradeoffs in worst-case equilibria. Theoretical Computer Science\u00a0361(2-3), 200\u2013209 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"13_CR4","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(2), 221\u2013237 (1995)","journal-title":"Journal of Algorithms"},{"key":"13_CR5","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, pp. 323\u2013332 (2008)"},{"key":"13_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P.: Scheduling Algorithms, 3rd edn. Springer, Heidelberg (2001)","edition":"3"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. In: SODA, pp. 815\u2013824 (2009)","DOI":"10.1137\/1.9781611973068.89"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM Journal on Computing\u00a09, 91\u2013103 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"13_CR10","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 413\u2013420 (2002)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0213044","volume":"13","author":"G. Dobson","year":"1984","unstructured":"Dobson, G.: Scheduling independent tasks on uniform processors. SIAM Journal on Computing\u00a013, 721\u2013726 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR12","unstructured":"Durr, C., Kim, T.N.: Non-clairvoyant scheduling games, http:\/\/www.lix.polytechnique.fr\/~thang\/Papers\/EQUI.pdf"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Scheduling in the dark. In: Proceedings of the 31st ACM Symposium on Theory of Computing, STOC (1999)","DOI":"10.1145\/301250.301299"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S.: Strong Price of Anarchy for Machine Load Balancing. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming, pp. 583\u2013594 (2007)","DOI":"10.1007\/978-3-540-73420-8_51"},{"key":"13_CR15","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":"13_CR16","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"D.K. Friesen","year":"1987","unstructured":"Friesen, D.K.: Tighter bounds for LPT scheduling on uniform processors. SIAM Journal on Computing\u00a016, 554\u2013560 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: 36th ACM Symposium on Theory of Computing, pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"45","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics\u00a045, 416\u2013429 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"13_CR20","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. Journal of the ACM\u00a024, 280\u2013289 (1977)","journal-title":"Journal of the ACM"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A.: Coordination Mechanisms for Selfish Scheduling. In: Proceedings of the 1st International Workshop on Internet and Network Economics, pp. 55\u201369 (2005)","DOI":"10.1007\/11600930_7"},{"key":"13_CR22","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"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.1050.0152","volume":"361","author":"P. Schuurman","year":"2007","unstructured":"Schuurman, P., Vredeveld, T.: Performance guarantees of local search for multiprocessor scheduling. Informs Journal on Computing\u00a0361(1), 52\u201363 (2007)","journal-title":"Informs Journal on Computing"},{"key":"13_CR24","unstructured":"Vredeveld, T.: Combinatorial Approximation Algorithms: Guaranteed Versus Experimental Performance. PhD thesis, Technische Universiteit Eindhoven, The Netherlands (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04645-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:00Z","timestamp":1606185780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}