{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:51:17Z","timestamp":1680450677657},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T00:00:00Z","timestamp":1396915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s00224-014-9540-1","type":"journal-article","created":{"date-parts":[[2014,4,7]],"date-time":"2014-04-07T05:52:55Z","timestamp":1396849975000},"page":"576-597","source":"Crossref","is-referenced-by-count":2,"title":["Capacitated Network Design Games"],"prefix":"10.1007","volume":"57","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,8]]},"reference":[{"issue":"6","key":"9540_CR1","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1\u201325:22 (2008)","journal-title":"J. ACM"},{"key":"9540_CR2","unstructured":"Albers, S.: On the value of coordination in network design. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201908, pp. 294\u2013303. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"9540_CR3","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: SODA\u201907 (2007)"},{"key":"9540_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295\u2013304. IEEE Computer Society, Washington (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"9540_CR5","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: STOC, pp. 511-520 (2003)","DOI":"10.1145\/780542.780617"},{"issue":"5","key":"9540_CR6","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1111\/1468-0262.00155","volume":"68","author":"V Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A noncooperative model of network formation. Econometrica 68(5), 1181\u20131230 (2000)","journal-title":"Econometrica"},{"key":"9540_CR7","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess, D.: Uber ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"9540_CR8","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201905, pp. 99\u2013107. ACM, New York (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"9540_CR9","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29, 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"9540_CR10","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. In: Proceedings of ACM EC, pp. 108\u2013114 (2003)","DOI":"10.1145\/779928.779942"},{"key":"9540_CR11","doi-asserted-by":"crossref","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. In: Proceedings of the 8th ACM Conference on Electronic Commerce, EC \u201907, pp. 84\u201392. ACM, New York (2007)","DOI":"10.1145\/1250910.1250924"},{"issue":"1","key":"9540_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.geb.2008.04.011","volume":"66","author":"A Epstein","year":"2009","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Efficient graph topologies in network routing games. Games Econ. Behav. 66(1), 115\u2013125 (2009)","journal-title":"Games Econ. Behav."},{"key":"9540_CR13","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: ICALP, pp. 502-513 (2003)","DOI":"10.1007\/3-540-45061-0_41"},{"key":"9540_CR14","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC \u201904, pp. 604\u2013612. ACM, New York (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"9540_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, M., Tamir, T.: Convergence rate of best response dynamics in scheduling games with conflicting congestion effects. Working Paper (2011)","DOI":"10.1007\/978-3-642-35311-6_38"},{"issue":"1","key":"9540_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00224-009-9205-7","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D.: Congestion games with linearly independent paths: convergence time and price of anarchy. Theory Comput. Syst. 47(1), 113\u2013136 (2010)","journal-title":"Theory Comput. Syst."},{"key":"9540_CR17","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Skopalik, A.: Stability and convergence in selfish scheduling with altruistic agents. In: Proceedings of the 5th International Workshop on Internet and Network Economics, WINE \u201909, pp. 616\u2013622. Springer-Verlag, Berlin, (2009)","DOI":"10.1007\/978-3-642-10841-9_63"},{"issue":"1-2","key":"9540_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R Holzman","year":"1997","unstructured":"Holzman, R., Nissan, L.-Y.: Strong equilibrium in congestion games. Games Econ. Behav. 21(1-2), 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"9540_CR19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0165-4896(03)00076-3","volume":"46","author":"R Holzman","year":"2003","unstructured":"Holzman, R., Nissan, L.-y.: Network structure and strong equilibrium in route selection games. Math. Soc. Sci. 46(2), 193\u2013205 (2003)","journal-title":"Math. Soc. Sci."},{"key":"9540_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/9.557575","volume":"42","author":"YA Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Capacity allocation under noncooperative routing. IEEE Trans. Autom. Control 42, 309\u2013325 (1997)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9540_CR21","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9540_CR22","doi-asserted-by":"crossref","unstructured":"Chen, H.l., Roughgarden, T.: Network design with weighted players. In: Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architextures (SPAA), pp. 29\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"9540_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/moor.1040.0122","volume":"30","author":"I Milchtaich","year":"2005","unstructured":"Milchtaich, I.: Topological conditions for uniqueness of equilibrium in networks. Math. Oper. Res. 30, 225\u2013244 (2005)","journal-title":"Math. Oper. Res."},{"key":"9540_CR24","doi-asserted-by":"crossref","unstructured":"Milchtaich, I.: The equilibrium existence problem in finite network congestion games. In: Proceedings of the 2nd International Workshop on Internet and Network Economics (WINE), pp. 87\u201398 (2006)","DOI":"10.1007\/11944874_9"},{"issue":"2","key":"9540_CR25","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.geb.2005.09.005","volume":"57","author":"I Milchtaich","year":"2006","unstructured":"Milchtaich, I.: Network topology and the efficiency of equilibrium. Games Econ. Behav. 57(2), 321\u2013346 (2006)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"9540_CR26","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D.: Potential games. Games Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"9540_CR27","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC \u201901, pp. 749\u2013753. ACM, New York (2001)","DOI":"10.1145\/380752.380883"},{"issue":"1","key":"9540_CR28","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9540_CR29","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, STOC \u201902, pp. 428\u2013437. ACM, New York (2002)","DOI":"10.1145\/509907.509971"},{"issue":"2","key":"9540_CR30","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"9540_CR31","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V.: The complexity of equilibria in cost sharing games. In: Proceedings of the 6th international conference on Internet and network economics, WINE\u201910, pp. 366\u2013377. Springer-Verlag, Berlin (2010)","DOI":"10.1007\/978-3-642-17572-5_30"},{"key":"9540_CR32","doi-asserted-by":"crossref","unstructured":"von Falkenhausen, P., Harks, T.: Optimal cost sharing protocols for scheduling games. In: Proceedings of the 12th ACM Conference on Electronic Commerce, EC \u201911, pp. 285\u2013294. ACM, New York (2011)","DOI":"10.1145\/1993574.1993618"},{"issue":"1","key":"9540_CR33","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1239\/jap\/1032374242","volume":"36","author":"AOYA Korilis","year":"1999","unstructured":"Korilis, A.O.Y.A., Lazar, A.A.: Avoiding the braess paradox in noncooperative networks. J. Appl. Probab. 36(1), 211\u2013222 (1999)","journal-title":"J. Appl. Probab."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9540-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9540-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9540-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T08:44:45Z","timestamp":1565340285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9540-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,8]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9540"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9540-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,8]]}}}