{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:30:02Z","timestamp":1742956202711,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022494"},{"type":"electronic","value":"9783642022500"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02250-0_9","type":"book-chapter","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T11:17:06Z","timestamp":1258456626000},"page":"241-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Game-Theoretic Approaches to Optimization Problems in Communication Networks"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[]},{"given":"Angelo","family":"Fanelli","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Gianpiero","family":"Monaco","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,9]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS \u201906), LNCS 3884, pp. 218-229, 2006","DOI":"10.1007\/11672142_17"},{"key":"9_CR2","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J. M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS \u201904), IEEE Computer Society, pp. 295-304, 2004"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-optimal network design with selfish agents. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC \u201903). ACM Press, pp. 511-520, 2003","DOI":"10.1145\/780542.780617"},{"key":"9_CR4","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 \u201905), ACM Press, pp. 57-66, 2005","DOI":"10.1145\/1060590.1060599"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Azar Y., Epstein, A.: The hardness of network design for unsplittable flow with selfish users. In: Proceedings of the 3rd Workshop on Approximation and Online Algorithms (WAOA \u201905), LNCS 3879, pp. 41-54, 2005","DOI":"10.1007\/11671411_4"},{"key":"9_CR6","unstructured":"Azar, Y., Jain, K., Mirrokni, V. S.: (Almost) optimal coordination mechanisms for unrelated machine scheduling. In: Proceedings of the 19th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA \u201908), pp. 323-332, 2008"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V.: The price of Nash equilibria in multicast transmission games. In: Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC \u201907), LNCS 4835, pp. 390-401, 2007","DOI":"10.1007\/978-3-540-77120-3_35"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Melideo, G., Moscardelli, L.: Designing fast converging cost sharing methods for multicast transmissions. Theory of Computing Systems, online first, 2009","DOI":"10.1007\/s00224-009-9207-5"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical congestion games with linear latencies. In: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201908), pp. 194-196, 2008","DOI":"10.1145\/1378533.1378571"},{"key":"9_CR10","unstructured":"Moscardelli, L.: When ignorance helps: graphical multicast cost sharing games. In: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS \u201908), LNCS 5162, pp. 108-119, 2008"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Flammini, M.: Extending the notion of rationality of selfish agents: second order Nash equilibria. In: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS \u201907), LNCS 4708, pp. 621-632, 2007","DOI":"10.1007\/978-3-540-74456-6_55"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Flammini, M., Moscardelli, L.: On Nash equilibria in non-cooperative all-optical networks. In: Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS \u201905), LNCS 3404, pp. 448-459, 2005","DOI":"10.1007\/978-3-540-31856-9_37"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/BF01918335","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon der Verkehrsplanung. Unternehmensforschung, 12:258-268, 1968","journal-title":"Unternehmensforschung"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. In: Proceedings of the 20th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA \u201909), pp. 815\u2013824, 2009","DOI":"10.1137\/1.9781611973068.89"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., and Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP \u201906), LNCS 4051, Part I, pp. 311-322, 2006","DOI":"10.1007\/11786986_28"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Taxes for linear atomic congestion games. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA \u201906), LNCS 4168, pp. 184-195, 2006","DOI":"10.1007\/11841036_19"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Improving the efficiency of load balancing games through taxes. In: Proceedings of the 4th International Workshop on Internet and Network Economics (WINE \u201908), LNCS 5385, pp. 374-385, 2008","DOI":"10.1007\/978-3-540-92185-1_43"},{"key":"9_CR18","unstructured":"Charikar, M., Mattieu, C., Karloff, H., Naor, J., Saks, M.: Best response dynamics in multicast cost sharing. In: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201908), pp. 70-76, 2008"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. In: Proceedings of the 7th ACM Conference on Electronic Commerce (EC \u201906), ACM Press, pp. 72-81, 2006","DOI":"10.1145\/1134707.1134716"},{"key":"9_CR20","unstructured":"Chen, H., Roughgarden, T., Valiant, G.: Designing networks with good equilibria. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201908), ACM Press, pp. 854-863, 2008"},{"key":"9_CR21","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 \u201905), ACM Press, pp. 67-73, 2005","DOI":"10.1145\/1060590.1060600"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In Proceedongs of the 13th Annual European Symposium on Algorithms (ESA \u201905), LNCS 3669, pp. 59-70, 2005","DOI":"10.1007\/11561071_8"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: Proceedings of the 31st Annual International Colloquium on Automata, Languages, and Programming (ICALP \u201904), LNCS 3142, pp. 345-357, 2004","DOI":"10.1007\/978-3-540-27836-8_31"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Mirrokni, V., Sidiropoulos, A.: Convergence and approximation in potential games. In: Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS \u201906), LNCS 3884, Springer, pp. 349-260, 2006","DOI":"10.1007\/11672142_28"},{"key":"9_CR25","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 \u201903), ACM Press, pp. 521-530, 2003","DOI":"10.1145\/780542.780618"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Fanelli, A., Flammini, M., Moscardelli, L.: On the convergence of multicast games in directed networks. In: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201907), ACM Press, pp. 330-338, 2007","DOI":"10.1145\/1248377.1248433"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Fanelli, A., Flammini, M., Moscardelli, L.: The speed of convergence in congestion games under best-response dynamics. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP \u201908), LNCS 5125. Part I, pp. 796-807, 2008","DOI":"10.1007\/978-3-540-70575-8_65"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the price of stability for designing undirected networks with fair cost allocations. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP \u201906), LNCS 4051, Part I, pp. 608-618, 2006","DOI":"10.1007\/11786986_53"},{"key":"9_CR29","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 \u201904), IEEE Computer Society, pp. 277-285, 2004"},{"issue":"2-3","key":"9_CR30","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theoretical Computer Science, 348(2-3): 226-239, 2005","journal-title":"Theoretical Computer Science"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Li, L., Mirrokni, V. S., Schulz, A.: Coordination mechanisms for selfish scheduling. In: Proceedings of the 1st Workshop on Internet and Network Economics (WINE \u201905), LNCS 3828, pp. 55-69, 2005","DOI":"10.1007\/11600930_7"},{"key":"9_CR32","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 \u201904), IEEE Computer Society, pp. 268-276, 2004"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC \u201900), ACM Press, pp. 163-170, 2000","DOI":"10.1145\/335305.335325"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Small-world phenomena and the dynamics of information. In: Proceedings of the 14th Advances in Neural Information Processing Systems (NIPS \u201901), pp. 431-438, 2001","DOI":"10.7551\/mitpress\/1120.003.0060"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C. H.: Worst-case Equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS \u201999), LNCS 1653, pp. 404-413, 1999","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Mirrokni, V. S., Vetta, A.: Convergence issues in competitive games. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX \u201904), LNCS 3122, pp. 183-194, 2004","DOI":"10.1007\/978-3-540-27821-4_17"},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L. S.: Potential games. Games and Economic Behavior. 14:124-143, 1996","journal-title":"Games and Economic Behavior."},{"key":"9_CR38","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person games. In: Proceedings of the National Academy of Sciences, volume 36, pp. 48-49, 1950","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. V.: Algorithmic game theory. Cambridge University Press, 2007","DOI":"10.1017\/CBO9780511800481"},{"key":"9_CR40","unstructured":"Pigou, A. C.: The economics of welfare. Macmillan, 1920"},{"key":"9_CR41","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, 2:65-67, 1973","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"9_CR42","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. SIAM Journal on Computing, 33(2): 332-350, 2004","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"9_CR43","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T. Roughgarden","year":"2006","unstructured":"Roughgarden, T.: On the severity of Braess\u2019s Paradox: designing networks for selfish users is hard. Journal of Computer and System Sciences, 72(5): 922-953, 2006","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"9_CR44","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, 49(2): 236-259, 2002","journal-title":"Journal of the ACM"},{"key":"9_CR45","unstructured":"Shapley, L. S.: The value of n-person games. Contributions to the theory of games, pp. 31-40, Princeton University Press, 1953"},{"issue":"1","key":"9_CR46","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, 47(1): 79-96, 2007","journal-title":"Algorithmica"}],"container-title":["Texts in Theoretical Computer Science. An EATCS Series","Graphs and Algorithms in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02250-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,17]],"date-time":"2024-03-17T17:58:19Z","timestamp":1710698299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02250-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022494","9783642022500"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02250-0_9","relation":{},"ISSN":["1862-4499"],"issn-type":[{"type":"print","value":"1862-4499"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"9 November 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}