{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:05:18Z","timestamp":1778270718541,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T00:00:00Z","timestamp":1434326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","award":["4\/11"],"award-info":[{"award-number":["4\/11"]}],"id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Technion-Microsoft Electronic Commerce Research Center"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1404\/10"],"award-info":[{"award-number":["1404\/10"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,15]]},"DOI":"10.1145\/2764468.2764535","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"715-732","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Truthful Online Scheduling with Commitments"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Blavatnik School of CS, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inna","family":"Kalp-Shaltiel","sequence":"additional","affiliation":[{"name":"Blavatnik School of CS, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ishai","family":"Menache","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Yaniv","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Aaron Archer and \u00c9va Tardos. 2001. Truthful mechanisms for one-parameter agents. In FOCS. 482--491. Aaron Archer and \u00c9va Tardos. 2001. Truthful mechanisms for one-parameter agents. In FOCS. 482--491.","DOI":"10.1109\/SFCS.2001.959924"},{"key":"e_1_3_2_1_2_1","unstructured":"Azure. 2015. Azure Machine Learning Pricing. http:\/\/azure.microsoft.com\/en-us\/pricing\/details\/machine-learning\/. (2015). Azure. 2015. Azure Machine Learning Pricing. http:\/\/azure.microsoft.com\/en-us\/pricing\/details\/machine-learning\/. (2015)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797321237"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612702"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795283292"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435765"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2670981"},{"key":"e_1_3_2_1_8_1","volume-title":"Palis","author":"DasGupta Bhaskar","year":"2000","unstructured":"Bhaskar DasGupta and Michael A . Palis . 2000 . Online real-time preemptive scheduling of jobs with deadlines. In APPROX. 96--107. Bhaskar DasGupta and Michael A. Palis. 2000. Online real-time preemptive scheduling of jobs with deadlines. In APPROX. 96--107."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168847"},{"key":"e_1_3_2_1_11_1","unstructured":"Juan A. Garay Joseph Naor B\u00fclent Yener and Peng Zhao. 2002. On-line Admission Control and Packet Scheduling with Interleaving. In INFOCOM. Juan A. Garay Joseph Naor B\u00fclent Yener and Peng Zhao. 2002. On-line Admission Control and Packet Scheduling with Interleaving. In INFOCOM."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064027"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00365440"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Navendu Jain Ishai Menache Joseph Naor and Jonathan Yaniv. 2011. A truthful mechanism for value-based scheduling in cloud computing. In SAGT. 178--189. Navendu Jain Ishai Menache Joseph Naor and Jonathan Yaniv. 2011. A truthful mechanism for value-based scheduling in cloud computing. In SAGT. 178--189.","DOI":"10.1007\/978-3-642-24829-0_17"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312051"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Gilad Koren and Dennis Shasha. 1992. Dover; an optimal on-line scheduling algorithm for overloaded real-time systems. In RTSS. 290--299. Gilad Koren and Dennis Shasha. 1992. Dover; an optimal on-line scheduling algorithm for overloaded real-time systems. In RTSS. 290--299.","DOI":"10.1109\/REAL.1992.242650"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90165-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250947"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486187"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258570"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988783"},{"key":"e_1_3_2_1_22_1","volume-title":"Approximation algorithms","author":"Vazirani Vijay V.","unstructured":"Vijay V. Vazirani . 2001. Approximation algorithms . Springer . Vijay V. Vazirani. 2001. Approximation algorithms. Springer."}],"event":{"name":"EC '15: ACM Conference on Economics and Computation","location":"Portland Oregon USA","acronym":"EC '15","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the Sixteenth ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764535","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764468.2764535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:23Z","timestamp":1750227143000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,15]]},"references-count":21,"alternative-id":["10.1145\/2764468.2764535","10.1145\/2764468"],"URL":"https:\/\/doi.org\/10.1145\/2764468.2764535","relation":{},"subject":[],"published":{"date-parts":[[2015,6,15]]},"assertion":[{"value":"2015-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}