{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:39:49Z","timestamp":1725521989085},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921844"},{"type":"electronic","value":"9783540921851"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_43","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T11:44:33Z","timestamp":1228909473000},"page":"374-385","source":"Crossref","is-referenced-by-count":5,"title":["Improving the Efficiency of Load Balancing Games through Taxes"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11841036_19","volume-title":"Algorithms \u2013 ESA 2006","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Taxes for linear atomic congestion games. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 184\u2013195. Springer, Heidelberg (2006)"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 521\u2013530 (2003)","DOI":"10.1145\/780615.780618"},{"issue":"3","key":"43_CR6","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.jcss.2005.09.010","volume":"72","author":"R. Cole","year":"2006","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? Journal of Computer and System Sciences\u00a072(3), 444\u2013467 (2006)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"43_CR7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1186810.1186814","volume":"3","author":"Artur Czumaj","year":"2007","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms\u00a03(1) (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"43_CR8","unstructured":"Ebenlendr, T., Krcal, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. In: Proceedings ot the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 483\u2013490 (2008)"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: On the complexity of pure equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 277\u2013285 (2004)","DOI":"10.1109\/FOCS.2004.69"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-75520-3_28","volume-title":"Algorithms \u2013 ESA 2007","author":"D. Fotakis","year":"2007","unstructured":"Fotakis, D.: Stackelberg strategies for atomic congestion games. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 299\u2013310. Springer, Heidelberg (2007)"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77105-0_19","volume-title":"Internet and Network Economics","author":"D. Fotakis","year":"2007","unstructured":"Fotakis, D., Spirakis, P.: Cost-balancing tolls for atomic network congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 179\u2013190. Springer, Heidelberg (2007)"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.: Edge pricing of multicommodity networks for heterogeneous selfish users. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 268\u2013276 (2004)","DOI":"10.1109\/FOCS.2004.26"},{"issue":"6","key":"43_CR14","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E. Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory of Computing Systems\u00a036(6), 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"43_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"T. L\u00fccking","year":"2004","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 547\u2013558. Springer, Heidelberg (2004)"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games and the internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"43_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"43_CR19","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences\u00a067(2), 341\u2013364 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR20","volume-title":"Algorithmic Game Theory","author":"T. Roughgarden","year":"2007","unstructured":"Roughgarden, T.: Routing games. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"2","key":"43_CR21","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"issue":"1","key":"43_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S. Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica\u00a047(1), 79\u201396 (2007)","journal-title":"Algorithmica"},{"key":"43_CR23","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 1133\u20131142 (2007)"},{"issue":"4","key":"43_CR24","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B. V\u00f6cking","year":"2003","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. Journal of the ACM\u00a050(4), 568\u2013589 (2003)","journal-title":"Journal of the ACM"},{"key":"43_CR25","volume-title":"Algorithmic Game Theory","author":"B. V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish load balancing. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T00:21:11Z","timestamp":1557966071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}