{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:30Z","timestamp":1759638930775},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_8","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T18:43:34Z","timestamp":1472928214000},"page":"93-104","source":"Crossref","is-referenced-by-count":1,"title":["On the Robustness of the Approximate Price of\u00a0Anarchy in Generalized Congestion Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5), 1211\u20131233 (2011)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"8_CR2","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1007\/s00224-014-9602-4","volume":"57","author":"A Anagnostopoulos","year":"2015","unstructured":"Anagnostopoulos, A., Becchetti, L., de Keijzer, B., Sch\u00e4fer, G.: Inefficiency of games with social context. Theory Comput. Syst. 57(3), 782\u2013804 (2015)","journal-title":"Theory Comput. Syst."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, L.: The price of routing unsplittable flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 57\u201366. ACM Press (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"4","key":"8_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2629666","volume":"2","author":"K Bhawalkar","year":"2014","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: price of anarchy, universal worst-case examples, and tightness. ACM Trans. Econ. Comput. 2(4), 1\u201323 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-642-38016-7_18","volume-title":"Approximation and Online Algorithms","author":"V Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 215\u2013228. Springer, Heidelberg (2013)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/978-3-319-08783-2_47","volume-title":"Computing and Combinatorics","author":"V Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, V.: On linear congestion games with altruistic social context. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds.) COCOON 2014. LNCS, vol. 8591, pp. 547\u2013558. Springer, Heidelberg (2014)"},{"key":"8_CR7","unstructured":"Bil\u00f2, V.: On the robustness of the approximate price of anarchy in generalized congestion games. CoRR abs\/1412.0845 (2014)"},{"key":"8_CR8","unstructured":"Bil\u00f2, V., Fanelli, A., Moscardelli, L.: On lookahead equilibria in linear congestion games. Math. Struct. Comput. Sci. (to appear)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-642-31104-8_13","volume-title":"Structural Information and Communication Complexity","author":"V Bil\u00f2","year":"2012","unstructured":"Bil\u00f2, V., Flammini, M., Gallotti, V.: On bidimensional congestion games. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 147\u2013158. Springer, Heidelberg (2012)"},{"issue":"1","key":"8_CR10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s00224-013-9529-1","volume":"56","author":"V Bil\u00f2","year":"2015","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., Moscardelli, L.: Some anomalies of farsighted strategic behavior. Theory Comput. Syst. 56(1), 156\u2013180 (2015)","journal-title":"Theory Comput. Syst."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Paladini, M.: On the performance of mildly greedy players in cut games. J. Comb. Optim. (to appear)","DOI":"10.1007\/978-3-319-08783-2_44"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-662-48995-6_10","volume-title":"Web and Internet Economics","author":"V Bil\u00f2","year":"2015","unstructured":"Bil\u00f2, V., Vinci, C.: On stackelberg strategies in affine congestion games. In: Markakis, E., Sch\u00e4fer, G. (eds.) WINE 2015. LNCS, vol. 9470, pp. 132\u2013145. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48995-6_10"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Vinci, C.: Dynamic taxes for polynomial congestion games. In: Proceedings of the 17th ACM Conference on Economics and Computation (EC) (to appear)","DOI":"10.1145\/2940716.2940750"},{"key":"8_CR14","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), pp. 67\u201373. ACM Press (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"G Christodoulou","year":"2011","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"crossref","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 Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"8_CR19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in $$n$$ -person games. Proc. Nat. Acad. Sci. 36(1), 48\u201349 (1950)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/978-3-642-45046-4_32","volume-title":"Web and Internet Economics","author":"M Rahn","year":"2013","unstructured":"Rahn, M., Sch\u00e4fer, G.: Bounding the inefficiency of altruism through social contribution games. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 391\u2013404. Springer, Heidelberg (2013)"},{"issue":"1","key":"8_CR21","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"},{"issue":"7","key":"8_CR22","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/2209249.2209274","volume":"55","author":"T Roughgarden","year":"2012","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. Commun. ACM 55(7), 116\u2013123 (2012)","journal-title":"Commun. ACM"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: The value of $$n$$ -person games. In: Contributions to the Theory of Games, pp. 31\u201340. Princeton University Press, Princeton (1953)","DOI":"10.1515\/9781400881970-018"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T01:54:09Z","timestamp":1568339649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}