{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:20Z","timestamp":1725895340073},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642339950"},{"type":"electronic","value":"9783642339967"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33996-7_12","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T07:27:01Z","timestamp":1349508421000},"page":"132-143","source":"Crossref","is-referenced-by-count":5,"title":["Capacitated Network Design Games"],"prefix":"10.1007","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","reference":[{"key":"12_CR1","first-page":"294","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008","author":"S. Albers","year":"2008","unstructured":"Albers, S.: On the value of coordination in network design. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 294\u2013303. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"12_CR2","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong Price of Anarchy. In: SODA 2007 (2007)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/FOCS.2004.68","volume-title":"Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science","author":"E. Anshelevich","year":"2004","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, DC (2004)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: STOC, pp. 511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"issue":"5","key":"12_CR5","doi-asserted-by":"publisher","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\u00a068(5), 1181\u20131230 (2000)","journal-title":"Econometrica"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/1073814.1073833","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005","author":"J. Corbo","year":"2005","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 2005, pp. 99\u2013107. ACM, New York (2005)"},{"key":"12_CR7","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: Proc. of ACM EC, pp. 108\u2013114 (2003)","DOI":"10.1145\/779928.779942"},{"key":"12_CR8","first-page":"84","volume-title":"Proceedings of the 8th ACM Conference on Electronic Commerce, EC 2007","author":"A. Epstein","year":"2007","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 2007, pp. 84\u201392. ACM, New York (2007)"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","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 and Economic Behavior\u00a066(1), 115\u2013125 (2009)","journal-title":"Games and Economic Behavior"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/1007352.1007445","volume-title":"Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2004","author":"A. Fabrikant","year":"2004","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 2004, pp. 604\u2013612. ACM, New York (2004)"},{"key":"12_CR12","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":"12_CR13","doi-asserted-by":"publisher","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.\u00a047(1), 113\u2013136 (2010)","journal-title":"Theory Comput. Syst."},{"key":"12_CR14","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"1-2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R. Holzman","year":"1997","unstructured":"Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games and Economic Behavior\u00a021(1-2), 85\u2013101 (1997)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0165-4896(03)00076-3","volume":"46","author":"R. Holzman","year":"2003","unstructured":"Holzman, R., Law-Yone (Lev-tov), N.: Network structure and strong equilibrium in route selection games. Mathematical Social Sciences\u00a046(2), 193\u2013205 (2003)","journal-title":"Mathematical Social Sciences"},{"key":"12_CR17","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":"12_CR18","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":"12_CR19","doi-asserted-by":"publisher","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. Mathematics of Operations Research\u00a030, 225\u2013244 (2005)","journal-title":"Mathematics of Operations Research"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11944874_9","volume-title":"Internet and Network Economics","author":"I. Milchtaich","year":"2006","unstructured":"Milchtaich, I.: The Equilibrium Existence Problem in Finite Network Congestion Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 87\u201398. Springer, Heidelberg (2006)"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","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 and Economic Behavior\u00a057(2), 321\u2013346 (2006)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D.: Potential games. Games and Economic Behavior\u00a014(1), 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/380752.380883","volume-title":"Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001","author":"C. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 749\u2013753. ACM, New York (2001)"},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory\u00a02(1), 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","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\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33996-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T03:04:57Z","timestamp":1687748697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33996-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642339950","9783642339967"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33996-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}