{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:07:32Z","timestamp":1773965252355,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993708","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"539-548","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Inner product spaces for MinSum coordination mechanisms"],"prefix":"10.1145","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Correa","sequence":"additional","affiliation":[{"name":"Universidad de Chile, Santiago, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Gkatzelis","sequence":"additional","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google Research, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Olver","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060599"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386832"},{"key":"e_1_3_2_2_4_1","first-page":"323","volume-title":"SODA","author":"Azar Y.","year":"2008","unstructured":"Y. Azar , K. Jain , and V.S. Mirrokni . (almost) optimal coordination mechanisms for unrelated machine scheduling . In SODA , pages 323 -- 332 , 2008 . Y. Azar, K. Jain, and V.S. Mirrokni. (almost) optimal coordination mechanisms for unrelated machine scheduling. In SODA, pages 323--332, 2008."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1008"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0009151"},{"key":"e_1_3_2_2_7_1","volume-title":"Studies in the Economics of Transportation","author":"Beckman M.","year":"1956","unstructured":"M. Beckman , C.B. McGuire , and C.B. Winsten . Studies in the Economics of Transportation . Yale University Press , 1956 . M. Beckman, C.B. McGuire, and C.B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956."},{"key":"e_1_3_2_2_8_1","first-page":"752","volume-title":"SODA","author":"Borodin A.","year":"2002","unstructured":"A. Borodin , M. Nielsen , and C. Rackoff . (incremental) priority algorithms . In SODA , pages 752 -- 7761 , 2002 . A. Borodin, M. Nielsen, and C. Rackoff. (incremental) priority algorithms. In SODA, pages 752 -- 761, 2002."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/361011.361064"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496859"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_28"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868251"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1983.11971218"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060600"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.005"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90025-6"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.09.010"},{"key":"e_1_3_2_2_18_1","volume-title":"Theory of Scheduling","author":"Conway R.W.","year":"1967","unstructured":"R.W. Conway , W.L. Maxwell , and L.W. Miller . Theory of Scheduling . Addison-Wesley , Reading, MA , 1967 . R.W. Conway, W.L. Maxwell, and L.W. Miller. Theory of Scheduling. Addison-Wesley, Reading, MA, 1967."},{"key":"e_1_3_2_2_19_1","unstructured":"J.R. Correa and M. Queyranne. Efficiency of equilibria in restricted uniform machine scheduling with minsum social cost. 2010 (manuscript).  J.R. Correa and M. Queyranne. Efficiency of equilibria in restricted uniform machine scheduling with minsum social cost. 2010 (manuscript)."},{"key":"e_1_3_2_2_20_1","first-page":"413","volume-title":"SODA","author":"Czumaj A.","year":"2002","unstructured":"A. Czumaj and B. V\u00f6cking . Tight bounds for worst-case equilibria . In SODA , pages 413 -- 420 , 2002 . A. Czumaj and B. V\u00f6cking. Tight bounds for worst-case equilibria. In SODA, pages 413--420, 2002."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322284"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_13"},{"key":"e_1_3_2_2_23_1","first-page":"502","volume-title":"ICALP","author":"E.","year":"2003","unstructured":"E. Even-dar, A. Kesselman , and Y. Mansour . Convergence time to nash equilibria . In ICALP , pages 502 -- 513 , 2003 . E. Even-dar, A. Kesselman, and Y. Mansour. Convergence time to nash equilibria. In ICALP, pages 502--513, 2003."},{"key":"e_1_3_2_2_24_1","volume-title":"A priority-based model of routing. Chicago Journal of Theoretical Computer Science","author":"Farzad B.","year":"2008","unstructured":"B. Farzad , N. Olver , and A. Vetta . A priority-based model of routing. Chicago Journal of Theoretical Computer Science , 2008 (1). B. Farzad, N. Olver, and A. Vetta. A priority-based model of routing. Chicago Journal of Theoretical Computer Science, 2008(1)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01930985"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.69"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973006.9"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210046"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.3.513"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_4"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645588.659621"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.3.846"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322011"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.032"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9299-y"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.554730"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_2_39_1","first-page":"281","article-title":"Complexity of machine scheduling problems","volume":"4","author":"Lenstra J.K.","year":"1977","unstructured":"J.K. Lenstra , A.H.G. Rinnooy Kan , and P. Brucker . Complexity of machine scheduling problems . Ann. Discrete Math. , 4 : 281 -- 300 , 1977 . J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Ann. Discrete Math., 4:281--300, 1977.","journal-title":"Ann. Discrete Math."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380783"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536485"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209007"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199357078"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/645590.659919"},{"key":"e_1_3_2_2_45_1","first-page":"963","volume-title":"SODA","author":"Sethuraman J.","year":"1999","unstructured":"J. Sethuraman and M.S. Squillante . Optimal scheduling of multiclass parallel machines . In SODA , pages 963 -- 964 , 1999 . J. Sethuraman and M.S. Squillante. Optimal scheduling of multiclass parallel machines. In SODA, pages 963--964, 1999."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375840"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.1.63.15212"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"W. Smith. Various optimizers for single stage production. Naval Res. Logist. Quart. 3(1--2):59--66 1956.  W. Smith. Various optimizers for single stage production. Naval Res. Logist. Quart. 3(1--2):59--66 1956.","DOI":"10.1002\/nav.3800030106"},{"key":"e_1_3_2_2_49_1","volume-title":"Marktform und Gleichgewicht","author":"von Stackelberg H.","year":"1934","unstructured":"H. von Stackelberg . Marktform und Gleichgewicht . Springer-Verlag , 1934 . English translation entitled The Theory of the Market Economy. H. von Stackelberg. Marktform und Gleichgewicht. Springer-Verlag, 1934. English translation entitled The Theory of the Market Economy."},{"key":"e_1_3_2_2_50_1","volume-title":"Combinatorial approximation algorithms. Guaranteed versus experimental performance","author":"Vredeveld T.","year":"2002","unstructured":"T. Vredeveld . Combinatorial approximation algorithms. Guaranteed versus experimental performance . 2002 . Ph .D. thesis. T. Vredeveld. Combinatorial approximation algorithms. Guaranteed versus experimental performance. 2002. Ph.D. thesis."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:11Z","timestamp":1750244771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":50,"alternative-id":["10.1145\/1993636.1993708","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993708","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}