{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:36Z","timestamp":1746331416265,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_16","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"186-197","source":"Crossref","is-referenced-by-count":3,"title":["Coordination Mechanisms for Selfish Routing over Time on a Tree"],"prefix":"10.1007","author":[{"given":"Sayan","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Janardhan","family":"Kulkarni","sequence":"additional","affiliation":[]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1402958.1402967","volume-title":"Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, SIGCOMM 2008","author":"M. Al-Fares","year":"2008","unstructured":"Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. In: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, SIGCOMM 2008, pp. 63\u201374. ACM, New York (2008)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1228\u20131241. SIAM (2012)","DOI":"10.1137\/1.9781611973099.97"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Antoniadis, A., Moseley, B., Barcelo, N., Nugent, M., Cole, D., Pruhs, K.: Packet forwarding algorithms in a line network (2014)","DOI":"10.1007\/978-3-642-54423-1_53"},{"key":"16_CR4","unstructured":"Azar, Y., Jain, K., Mirrokni, V.: (almost) optimal coordination mechanisms for unrelated machine scheduling. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 323\u2013332. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Kulkarni, J.: Minimizing flow-time on unrelated machines. CoRR, abs\/1401.7284 (2014)","DOI":"10.1145\/2746539.2746601"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Im, S., Kulkarni, J., Munagala, K.: Coordination mechanisms from (almost) all scheduling policies. In: 5th Innovations in Theoretical Computer Science Conference, ITCS 2014 (2014)","DOI":"10.1145\/2554797.2554811"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-45046-4_6","volume-title":"Web and Internet Economics","author":"V. Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V., Fanelli, A., Moscardelli, L.: On lookahead equilibria in congestion games. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol.\u00a08289, pp. 54\u201367. Springer, Heidelberg (2013)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. In: SODA, pp. 815\u2013824 (2009)","DOI":"10.1137\/1.9781611973068.89"},{"key":"16_CR9","unstructured":"Chekuri, C., Khanna, S.: Approximation algorithms for minimizing average weighted completion time (2004)"},{"issue":"36","key":"16_CR10","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G. Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci.\u00a0410(36), 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-23719-5_11","volume-title":"Algorithms \u2013 ESA 2011","author":"G. Christodoulou","year":"2011","unstructured":"Christodoulou, G., Mehlhorn, K., Pyrga, E.: Improving the price of anarchy for selfish routing via coordination mechanisms. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 119\u2013130. Springer, Heidelberg (2011)"},{"key":"16_CR12","first-page":"539","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011","author":"R. Cole","year":"2011","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 539\u2013548. ACM Press, New York (2011)"},{"key":"16_CR13","unstructured":"Farzad, B., Olver, N., Vetta, A.: A priority-based model of routing. Chicago J. Theor. Comput. Sci.\u00a02008 (2008)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Srinivasan, A.: Constraint satisfaction, packet routing, and the lovasz local lemma. In: STOC, pp. 685\u2013694 (2013)","DOI":"10.1145\/2488608.2488696"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-10841-9_4","volume-title":"Internet and Network Economics","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M., Mirrokni, V.S., R\u00f6glin, H., Teng, S.-H.: Competitive routing over time. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 18\u201329. Springer, Heidelberg (2009)"},{"key":"16_CR16","unstructured":"Im, S., Moseley, B.: Scheduling over tree. Personal communication (2014)"},{"issue":"17","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N. Immorlica","year":"2009","unstructured":"Immorlica, N., Li, L.E., Mirrokni, V.S., Schulz, A.S.: Coordination mechanisms for selfish scheduling. Theor. Comput. Sci.\u00a0410(17), 1589\u20131598 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Karger, D., Stein, C., Wein, J.: Scheduling algorithms (1997)","DOI":"10.1201\/9781420049503-c36"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00186-011-0357-2","volume":"73","author":"R. Koch","year":"2011","unstructured":"Koch, R., Nasrabadi, E., Skutella, M.: Continuous and discrete flows over time - a general model based on measure theory. Math. Meth. of OR\u00a073(3), 301\u2013337 (2011)","journal-title":"Math. Meth. of OR"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: STACS, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papakonstantinopoulou, K.: Contention issues in congestion games. In: ICALP (2), pp. 623\u2013635 (2012)","DOI":"10.1007\/978-3-642-31585-5_55"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.: Universal packet routing algorithms (extended abstract). In: FOCS, pp. 256\u2013269 (1988)","DOI":"10.21236\/ADA204273"},{"issue":"10","key":"16_CR23","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"34","author":"C.E. Leiserson","year":"1985","unstructured":"Leiserson, C.E.: Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Trans. Computers\u00a034(10), 892\u2013901 (1985)","journal-title":"IEEE Trans. Computers"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-12450-1_20","volume-title":"Approximation and Online Algorithms","author":"B. Peis","year":"2010","unstructured":"Peis, B., Skutella, M., Wiese, A.: Packet routing: Complexity and algorithms. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 217\u2013228. Springer, Heidelberg (2010)"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-36694-9_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"T. Rothvo\u00df","year":"2013","unstructured":"Rothvo\u00df, T.: A simpler proof for $O(\\textrm{Congestion} + \\textrm{Dilation})$ packet routing. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol.\u00a07801, pp. 336\u2013348. Springer, Heidelberg (2013)"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: STOC, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? In: FOCS, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Smith, W.: Various optimizers for single-stage production. Naval Research Logistics Quarterly\u00a0(3), 59\u201366 (1956)","DOI":"10.1002\/nav.3800030106"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:00Z","timestamp":1746264660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}