{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:56:45Z","timestamp":1777006605512,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488616","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"51-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Prior-independent mechanisms for scheduling"],"prefix":"10.1145","author":[{"given":"Shuchi","family":"Chawla","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason D.","family":"Hartline","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Malec","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balasubramanian","family":"Sivan","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873689"},{"key":"e_1_3_2_1_2_1","first-page":"482","volume-title":"FOCS","author":"Aaron","year":"2001","unstructured":"Aaron Archer and \u00c9va Tardos. Truthful mechanisms for one-parameter agents . In FOCS , pages 482 -- 491 , 2001 . Aaron Archer and \u00c9va Tardos. Truthful mechanisms for one-parameter agents. In FOCS, pages 482--491, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566399"},{"issue":"1","key":"e_1_3_2_1_4_1","first-page":"180","article-title":"Auctions vs negotiations","volume":"86","author":"Bulow Jeremy","year":"1996","unstructured":"Jeremy Bulow and Paul Klemperer . Auctions vs negotiations . American Economic Review , 86 ( 1 ): 180 -- 194 , 1996 . Jeremy Bulow and Paul Klemperer. Auctions vs negotiations. American Economic Review, 86(1):180--194, 1996.","journal-title":"American Economic Review"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214019"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2394539.2394547"},{"key":"e_1_3_2_1_8_1","first-page":"1163","volume-title":"SODA","author":"Christodoulou George","year":"2007","unstructured":"George Christodoulou , Elias Koutsoupias , and Angelina Vidali . A lower bound for scheduling mechanisms . In SODA , pages 1163 -- 1170 , 2007 . George Christodoulou, Elias Koutsoupias, and Angelina Vidali. A lower bound for scheduling mechanisms. In SODA, pages 1163--1170, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807368"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_11"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.71"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807364"},{"key":"e_1_3_2_1_14_1","volume-title":"Tight lower bounds on envy-free makespan approximation. CoRR, abs\/1205.1786","author":"Fiat Amos","year":"2012","unstructured":"Amos Fiat and Ariel Levavi . Tight lower bounds on envy-free makespan approximation. CoRR, abs\/1205.1786 , 2012 . Amos Fiat and Ariel Levavi. Tight lower bounds on envy-free makespan approximation. CoRR, abs\/1205.1786, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806732"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_3_2_1_18_1","first-page":"454","volume-title":"MFCS","author":"Koutsoupias Elias","year":"2007","unstructured":"Elias Koutsoupias and Angelina Vidali . A lower bound of 1+phi for truthful scheduling mechanisms . In MFCS , pages 454 -- 464 , 2007 . Elias Koutsoupias and Angelina Vidali. A lower bound of 1+phi for truthful scheduling mechanisms. In MFCS, pages 454--464, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250947"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_5"},{"key":"e_1_3_2_1_21_1","first-page":"527","volume-title":"STACS","author":"Lu Pinyan","year":"2008","unstructured":"Pinyan Lu and Changyuan Yu . An improved randomized truthful mechanism for scheduling unrelated machines . In STACS , pages 527 -- 538 , 2008 . Pinyan Lu and Changyuan Yu. An improved randomized truthful mechanism for scheduling unrelated machines. In STACS, pages 527--538, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_46"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04428-1_11"},{"key":"e_1_3_2_1_24_1","first-page":"1143","volume-title":"SODA","author":"Mu'alem Ahuva","year":"2007","unstructured":"Ahuva Mu'alem and Michael Schapira . Setting lower bounds on truthfulness: extended abstract . In SODA , pages 1143 -- 1152 , 2007 . Ahuva Mu'alem and Michael Schapira. Setting lower bounds on truthfulness: extended abstract. In SODA, pages 1143--1152, 2007."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229077"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133092"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488616","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":28,"alternative-id":["10.1145\/2488608.2488616","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488616","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}