{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:10Z","timestamp":1750307530670,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T00:00:00Z","timestamp":1246838400000},"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":[[2009,7,6]]},"DOI":"10.1145\/1566374.1566399","type":"proceedings-article","created":{"date-parts":[[2009,7,15]],"date-time":"2009-07-15T13:51:31Z","timestamp":1247665891000},"page":"169-176","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["An optimal lower bound for anonymous scheduling mechanisms"],"prefix":"10.1145","author":[{"given":"Itai","family":"Ashlagi","sequence":"first","affiliation":[{"name":"Harvard, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Dobzinski","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Lavi","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060682"},{"volume-title":"FOCS'01","author":"Aaron","key":"e_1_3_2_1_2_1","unstructured":"Aaron Archer and \u00c9va Tardos. Truthful mechanisms for one-parameter agents . In FOCS'01 . Aaron Archer and \u00c9va Tardos. Truthful mechanisms for one-parameter agents. In FOCS'01."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_25"},{"volume-title":"ICALP'07","author":"Christodoulou George","key":"e_1_3_2_1_4_1","unstructured":"George Christodoulou , Elias Koutsoupias , and Annam\u00e1ria Kov\u00e1cs . Mechanism design for fractional scheduling on unrelated machines . In ICALP'07 . George Christodoulou, Elias Koutsoupias, and Annam\u00e1ria Kov\u00e1cs. Mechanism design for fractional scheduling on unrelated machines. In ICALP'07."},{"volume-title":"SODA '07","author":"Christodoulou George","key":"e_1_3_2_1_5_1","unstructured":"George Christodoulou , Elias Koutsoupias , and Angelina Vidali . A lower bound for scheduling mechanisms . In SODA '07 . George Christodoulou, Elias Koutsoupias, and Angelina Vidali. A lower bound for scheduling mechanisms. In SODA '07."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.19"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.84"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.71"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386798"},{"volume-title":"MFCS'07","author":"Koutsoupias Elias","key":"e_1_3_2_1_10_1","unstructured":"Elias Koutsoupias and Angelina Vidali . A lower bound of 1 phi for truthful scheduling mechanisms . In MFCS'07 . Elias Koutsoupias and Angelina Vidali. A lower bound of 1 phi for truthful scheduling mechanisms. In MFCS'07."},{"volume-title":"FOCS'03","author":"Lavi Ron","key":"e_1_3_2_1_11_1","unstructured":"Ron Lavi , Ahuva Mu'alem , and Noam Nisan . Towards a characterization of truthful combinatorial auctions . In FOCS'03 . Ron Lavi, Ahuva Mu'alem, and Noam Nisan. Towards a characterization of truthful combinatorial auctions. In FOCS'03."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250947"},{"key":"e_1_3_2_1_13_1","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 , 2007 . Ahuva Mu'alem and Michael Schapira. Setting lower bounds on truthfulness: extended abstract. In SODA, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064040"}],"event":{"name":"EC '09: ACM Conference on Electronic Commerce","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"Stanford California USA","acronym":"EC '09"},"container-title":["Proceedings of the 10th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566399","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1566374.1566399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:10Z","timestamp":1750249390000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,6]]},"references-count":15,"alternative-id":["10.1145\/1566374.1566399","10.1145\/1566374"],"URL":"https:\/\/doi.org\/10.1145\/1566374.1566399","relation":{},"subject":[],"published":{"date-parts":[[2009,7,6]]},"assertion":[{"value":"2009-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}