{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T04:10:38Z","timestamp":1768882238704,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T00:00:00Z","timestamp":1311984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10951-011-0247-8","type":"journal-article","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T17:26:59Z","timestamp":1311960419000},"page":"157-164","source":"Crossref","is-referenced-by-count":25,"title":["Efficiency analysis of load balancing games with and without activation costs"],"prefix":"10.1007","volume":"15","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[]},{"given":"Sinan","family":"G\u00fcrel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,30]]},"reference":[{"key":"247_CR1","series-title":"LNCS: Vol","first-page":"218","volume-title":"Proceedings of the 23rd international symposium on theoretical aspects of computer science","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., & Schoppmann, F. (2006). Exact price of anarchy for polynomial congestion games. In B. Duran & W. Thomas (Eds.), LNCS: Vol.\u00a03884. Proceedings of the 23rd international symposium on theoretical aspects of computer science (pp.\u00a0218\u2013229). Berlin: Springer."},{"issue":"4","key":"247_CR2","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., & Roughgarden, T. (2008). The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4), 1602\u20131623.","journal-title":"SIAM Journal on Computing"},{"key":"247_CR3","first-page":"57","volume-title":"37th ACM symposium on theory of computing","author":"B. Awerbuch","year":"2005","unstructured":"Awerbuch, B., Azar, Y., & Epstein, A. (2005). The price of routing unsplittable flow. In 37th ACM symposium on theory of computing (pp.\u00a057\u201366), Baltimore, MD, USA, 22\u201324 May 2005."},{"key":"247_CR4","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/j.jda.2005.06.009","volume":"4","author":"P. Berenbrink","year":"2006","unstructured":"Berenbrink, P., Goldberg, L. A., Goldberg, P. W., & Martin, R. (2006). Utilitarian resource assignment. Journal of Discrete Algorithms, 4, 567\u2013587.","journal-title":"Journal of Discrete Algorithms"},{"key":"247_CR5","first-page":"517","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"A. Czumaj","year":"2004","unstructured":"Czumaj, A. (2004). Selfish routing on the Internet. In Handbook of scheduling: algorithms, models, and performance analysis (pp.\u00a0517\u2013542). Boca Raton: CRC Press, Chap. 42."},{"key":"247_CR6","first-page":"413","volume-title":"13th annual ACM-SIAM symposium on discrete algorithms","author":"A. Czumaj","year":"2002","unstructured":"Czumaj, A., & V\u00f6cking, B. (2002). Tight bounds for the worst-case equilibria. In 13th annual ACM-SIAM symposium on discrete algorithms (pp.\u00a0413\u2013420). Philadelphia: ACM-SIAM."},{"key":"247_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/860575.860604","volume-title":"The 2nd international joint conference on autonomous agents and multiagent systems (AAMAS)","author":"U. Endriss","year":"2003","unstructured":"Endriss, U., Maudet, N., Sadri, F., & Toni, F. (2003). On optimal outcomes of negotiations over resources. In The 2nd international joint conference on autonomous agents and multiagent systems (AAMAS) (pp.\u00a0177\u2013184), Melbourne, Australia, 2003."},{"key":"247_CR8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/1250910.1250924","volume-title":"EC \u201907: Proceedings of the 8th ACM conference on electronic commerce","author":"A. Epstein","year":"2007","unstructured":"Epstein, A., Feldman, M., & Mansour, Y. (2007). Strong equilibrium in cost sharing connection games. In EC \u201907: Proceedings of the 8th ACM conference on electronic commerce (pp.\u00a084\u201392). New York: ACM."},{"issue":"1","key":"247_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C. H., & Shenker, S. (2001). Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1), 21\u201341.","journal-title":"Journal of Computer and System Sciences"},{"key":"247_CR10","series-title":"LNCS: Vol","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-540-92185-1_19","volume-title":"Proceedings of the 4th international workshop on Internet and network economics","author":"M. Feldman","year":"2008","unstructured":"Feldman, M., & Tamir, T. (2008). Conflicting congestion effects in resource allocation games. In G. Goos, J. Hartmanis, & J. van Leeuwen (Eds.), LNCS: Vol.\u00a05385. Proceedings of the 4th international workshop on Internet and network economics (pp.\u00a0109\u2013117. Berlin\/Heidelberg: Springer."},{"key":"247_CR11","series-title":"LNCS: Vol","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/978-3-540-77105-0_42","volume-title":"Proceedings of the 3rd workshop on Internet and network economics (WINE 2007)","author":"M. Gairing","year":"2007","unstructured":"Gairing, M., & Scoppmann, F. (2007). Total latency in singleton congestion games. In X. Deng & F. C. Graham (Eds.), LNCS: Vol.\u00a04858. Proceedings of the 3rd workshop on Internet and network economics (WINE 2007) (pp.\u00a0381\u2013387. Berlin\/Heidelberg: Springer."},{"key":"247_CR12","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1016\/j.jcss.2008.07.001","volume":"74","author":"M. Gairing","year":"2008","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., & Rode, M. (2008a). Nash equilibria in discrete routing games with convex latency functions. Journal of Computer and System Sciences, 74, 1199\u20131225.","journal-title":"Journal of Computer and System Sciences"},{"key":"247_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00224-007-9015-8","volume":"42","author":"M. Gairing","year":"2008","unstructured":"Gairing, M., Monien, B., & Tiemann, K. (2008b). Selfish routing with incomplete information. Theory of Computing Systems, 42, 91\u2013130.","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"247_CR14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1111\/j.1937-5956.2007.tb00271.x","volume":"16","author":"B. Heydenreich","year":"2007","unstructured":"Heydenreich, B., M\u00fcller, R., & Uetz, M. (2007). Games and mechanism design in machine scheduling\u2014an introduction. Production and Operations Management, 16(4), 437\u2013454.","journal-title":"Production and Operations Management"},{"key":"247_CR15","unstructured":"Hoefer, M., & Souza, A. (2011). Tradeoffs and average-case equilibria in selfish routing. ACM Transactions on Computation Theory (to appear)."},{"key":"247_CR16","series-title":"LNCS: Vol","first-page":"404","volume-title":"Proceedings of the 16th international symposium on theoretical aspects of computer science","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In G. Goos, J. Hartmanis, & J. van Leeuwen (Eds.), LNCS: Vol.\u00a01563. Proceedings of the 16th international symposium on theoretical aspects of computer science (pp.\u00a0404\u2013413. Berlin: Springer."},{"issue":"3","key":"247_CR17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.tcs.2008.06.045","volume":"406","author":"T. L\u00fccking","year":"2008","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., & Rode, M. (2008). A new model for selfish routing. Theor. Comput. Sci., 406(3), 187\u2013206.","journal-title":"Theor. Comput. Sci."},{"key":"247_CR18","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/544741.544836","volume-title":"The 1st international joint conference on autonomous agents and multiagent systems (AAMAS)","author":"P. McBurney","year":"2002","unstructured":"McBurney, P., Parsons, S., & Wooldridge, M. (2002). Desiderata for argumentation protocols. In The 1st international joint conference on autonomous agents and multiagent systems (AAMAS) (pp.\u00a0402\u2013409), Bologna, Italy."},{"key":"247_CR19","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/380752.380883","volume-title":"Proc. 33rd ACM symposium on theory of computing","author":"C. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C. (2001). Algorithms, games, and the Internet. In Proc. 33rd ACM symposium on theory of computing (pp. 749\u2013753). New York: ACM Press."},{"key":"247_CR20","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/1536414.1536485","volume-title":"STOC \u201909: Proceedings of the 41st annual ACM symposium on theory of computing","author":"T. Roughgarden","year":"2009","unstructured":"Roughgarden, T. (2009). Intrinsic robustness of the price of anarchy. In STOC \u201909: Proceedings of the 41st annual ACM symposium on theory of computing (pp.\u00a0513\u2013522). New York: ACM."},{"issue":"2","key":"247_CR21","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., & Tardos, \u00c9. (2002). How bad is selfish routing? Journal of ACM, 49(2), 236\u2013259.","journal-title":"Journal of ACM"},{"key":"247_CR22","volume-title":"The AAAI spring symposium: satisficing models","author":"T. W. Sandholm","year":"1998","unstructured":"Sandholm, T. W. (1998). Contract types for satisficing task allocation: I theoretical results. In The AAAI spring symposium: satisficing models, Palo Alto, California, USA."},{"key":"247_CR23","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1017\/CBO9780511800481.022","volume-title":"Algorithmic game theory","author":"B. V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B. (2007). Selfish load balancing. In Algorithmic game theory (pp.\u00a0517\u2013542). Cambridge: Cambridge University Press."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0247-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0247-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0247-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T12:59:37Z","timestamp":1686229177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0247-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,30]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["247"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0247-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,30]]}}}