{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:13:52Z","timestamp":1758266032856,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"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.2488729","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"951-960","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The loss of serving in the dark"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Ilan Reuven","family":"Cohen","sequence":"additional","affiliation":[{"name":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Iftah","family":"Gamzu","sequence":"additional","affiliation":[{"name":"Blavatnik School of Computer Science, Tel-Aviv University, Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"Alon Noga","year":"2000","unstructured":"Noga Alon and Joel H. Spencer . The Probabilistic Method . Wiley , New York , second edition, 2000 . Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley, New York, second edition, 2000."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39989-6_12"},{"key":"e_1_3_2_1_4_1","first-page":"761","volume-title":"Proceedings 14th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Andelman Nir","year":"2003","unstructured":"Nir Andelman , Yishay Mansour , and An Zhu . Competitive queueing policies for qos switches . In Proceedings 14th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 761 -- 770 , 2003 . Nir Andelman, Yishay Mansour, and An Zhu. Competitive queueing policies for qos switches. In Proceedings 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 761--770, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007369"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2748\/tmj\/1178243286"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_19"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_17"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496892"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.03.005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1025-6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290687"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_16"},{"key":"e_1_3_2_1_16_1","volume-title":"Dubhashi and Alessandro Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms","author":"Devdatt","year":"2009","unstructured":"Devdatt P. Dubhashi and Alessandro Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms . Cambridge University Press , 2009 . Devdatt P. Dubhashi and Alessandro Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_33"},{"key":"e_1_3_2_1_18_1","first-page":"209","volume-title":"Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Englert Matthias","year":"2007","unstructured":"Matthias Englert and Matthias Westermann . Considering suppressed packets improves buffer management in qos switches . In Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 209 -- 218 , 2007 . Matthias Englert and Matthias Westermann. Considering suppressed packets improves buffer management in qos switches. In Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 209--218, 2007."},{"key":"e_1_3_2_1_19_1","first-page":"228","volume-title":"Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Fiat Amos","year":"2008","unstructured":"Amos Fiat , Yishay Mansour , and Uri Nadav . Competitive queue management for latency sensitive packets . In Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 228 -- 237 , 2008 . Amos Fiat, Yishay Mansour, and Uri Nadav. Competitive queue management for latency sensitive packets. In Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 228--237, 2008."},{"key":"e_1_3_2_1_20_1","first-page":"434","volume-title":"Proceedings Conference on Information Sciences and Systems","author":"Hajek Bruce","year":"2001","unstructured":"Bruce Hajek . On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time . In Proceedings Conference on Information Sciences and Systems , pages 434 -- 438 , 2001 . Bruce Hajek. On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In Proceedings Conference on Information Sciences and Systems, pages 434--438, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064027"},{"key":"e_1_3_2_1_22_1","volume-title":"Johnson and Samuel Kotz. Urn Models and Their Applications","author":"Norman","year":"1977","unstructured":"Norman L. Johnson and Samuel Kotz. Urn Models and Their Applications . John Wiley & Sons , 1977 . Norman L. Johnson and Samuel Kotz. Urn Models and Their Applications. John Wiley & Sons, 1977."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701399666"},{"key":"e_1_3_2_1_25_1","volume-title":"Improved competitive guarantees for qos buffering. Algorithmica, 43(1--2):63--80","author":"Kesselman Alexander","year":"2005","unstructured":"Alexander Kesselman , Yishay Mansour , and Rob van Stee . Improved competitive guarantees for qos buffering. Algorithmica, 43(1--2):63--80 , 2005 . Alexander Kesselman, Yishay Mansour, and Rob van Stee. Improved competitive guarantees for qos buffering. Algorithmica, 43(1--2):63--80, 2005."},{"key":"e_1_3_2_1_26_1","volume-title":"Random Allocations","author":"Kolchin Valentin F.","year":"1978","unstructured":"Valentin F. Kolchin , Boris A. Sevastyanov , and Vladimir P. Chistyakov . Random Allocations . John Wiley & Sons , 1978 . Valentin F. Kolchin, Boris A. Sevastyanov, and Vladimir P. Chistyakov. Random Allocations. John Wiley & Sons, 1978."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212147"},{"key":"e_1_3_2_1_28_1","first-page":"1146","volume-title":"Proceedings 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Lavi Ron","year":"2005","unstructured":"Ron Lavi and Noam Nisan . Online ascending auctions for gradually expiring items . In Proceedings 16th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 1146 -- 1155 , 2005 . Ron Lavi and Noam Nisan. Online ascending auctions for gradually expiring items. In Proceedings 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1146--1155, 2005."},{"key":"e_1_3_2_1_29_1","first-page":"801","volume-title":"Proceedings 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Li Fei","year":"2005","unstructured":"Fei Li , Jay Sethuraman , and Clifford Stein . An optimal online algorithm for packet scheduling with agreeable deadlines . In Proceedings 16th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 801 -- 802 , 2005 . Fei Li, Jay Sethuraman, and Clifford Stein. An optimal online algorithm for packet scheduling with agreeable deadlines. In Proceedings 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 801--802, 2005."},{"key":"e_1_3_2_1_30_1","first-page":"199","volume-title":"Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Li Fei","year":"2007","unstructured":"Fei Li , Jay Sethuraman , and Clifford Stein . Better online buffer management . In Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 199 -- 208 , 2007 . Fei Li, Jay Sethuraman, and Clifford Stein. Better online buffer management. In Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 199--208, 2007."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9_6"},{"volume-title":"Handbook of Randomized Computing","author":"Mitzenmacher Michael","key":"e_1_3_2_1_32_1","unstructured":"Michael Mitzenmacher , Andr\u00e9a W. Richa , and Ramesh Sitaraman . The power of two random choices: A survey of techniques and results . In Handbook of Randomized Computing . Springer . Michael Mitzenmacher, Andr\u00e9a W. Richa, and Ramesh Sitaraman. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing. Springer."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"Nisan Noam","year":"2007","unstructured":"Noam Nisan . Introduction to mechanism design (for computer scientists) . In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani, editors, Algorithmic Game Theory , chapter 9. Cambridge University Press , 2007 . Noam Nisan. Introduction to mechanism design (for computer scientists). In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani, editors, Algorithmic Game Theory, chapter 9. Cambridge University Press, 2007."},{"key":"e_1_3_2_1_35_1","volume-title":"Algorithmic Game Theory","author":"Parkes David C.","year":"2007","unstructured":"David C. Parkes . Online mechanisms . In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani, editors, Algorithmic Game Theory , chapter 16. Cambridge University Press , 2007 . David C. Parkes. Online mechanisms. In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani, editors, Algorithmic Game Theory, chapter 16. Cambridge University Press, 2007."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_24"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Palo Alto California USA","acronym":"STOC'13"},"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.2488729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:21Z","timestamp":1750235961000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":36,"alternative-id":["10.1145\/2488608.2488729","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488729","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"}}]}}