{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:32Z","timestamp":1766311412209},"publisher-location":"Berlin, Heidelberg","reference-count":30,"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_9","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"105-116","source":"Crossref","is-referenced-by-count":8,"title":["Efficiency of Equilibria in Uniform Matroid Congestion Games"],"prefix":"10.1007","author":[{"given":"Jasper","family":"de Jong","sequence":"first","affiliation":[]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-662-44777-2_2","volume-title":"Algorithms - ESA 2014","author":"F Abed","year":"2014","unstructured":"Abed, F., Correa, J.R., Huang, C.-C.: Optimal coordination mechanisms for multi-job scheduling games. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 13\u201324. Springer, Heidelberg (2014)"},{"issue":"6","key":"9_CR2","doi-asserted-by":"crossref","first-page":"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), 1\u201322 (2008)","journal-title":"J. ACM"},{"issue":"17","key":"9_CR3","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1016\/j.tcs.2008.12.035","volume":"410","author":"H Ackermann","year":"2009","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theoret. Comput. Sci. 410(17), 1552\u20131563 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"9_CR4","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."},{"key":"9_CR5","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 Theory Computing, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"9_CR6","volume-title":"Studies in the Economics and Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics and Transportation. Yale University Press, New Haven (1956)"},{"key":"9_CR7","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12, 258\u20130268 (1968). (German)","journal-title":"Unternehmensforschung"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Automata, Languages and Programming","author":"I Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"key":"9_CR9","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 Theory Computing, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"9_CR10","unstructured":"de Jong, J., Klimm, M., Uetz, M.: Efficiency of equilibria in uniform matroid congestion games. CTIT Technical report TR-CTIT-16-04, University of Twente (2016). http:\/\/eprints.eemcs.utwente.nl\/26855\/"},{"issue":"4","key":"9_CR11","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/moor.1080.0322","volume":"33","author":"J Dunkel","year":"2008","unstructured":"Dunkel, J., Schulz, A.S.: On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. Math. Oper. Res. 33(4), 851\u2013868 (2008)","journal-title":"Math. Oper. Res."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/s00224-008-9152-8","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D.: Stackelberg strategies for atomic congestion games. Theory Comput. Syst. 47, 218\u2013249 (2010)","journal-title":"Theory Comput. Syst."},{"key":"9_CR13","unstructured":"Fujishige, S., Goemans, M.X., Harks, T., Peis, B., Zenklusen, R.: Matroids are immune to Braess paradox. arXiv:1504.07545 (2015)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/978-3-540-77105-0_42","volume-title":"Internet and Network Economics","author":"M Gairing","year":"2007","unstructured":"Gairing, M., Schoppmann, F.: Total latency in singleton congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 381\u2013387. Springer, Heidelberg (2007)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: Proceedings of the 46th Annual IEEE Symposium Foundations of Computer Science, pp. 142\u2013154 (2005)","DOI":"10.1109\/SFCS.2005.68"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-319-13129-0_14","volume-title":"Web and Internet Economics","author":"T Harks","year":"2014","unstructured":"Harks, T., Klimm, M., Peis, B.: Resource competition on integral polymatroids. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 189\u2013202. Springer, Heidelberg (2014)"},{"issue":"3","key":"9_CR18","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s00453-014-9876-6","volume":"70","author":"T Harks","year":"2014","unstructured":"Harks, T., Peis, B.: Resource buying games. Algorithmica 70(3), 493\u2013512 (2014)","journal-title":"Algorithmica"},{"key":"9_CR19","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":"3","key":"9_CR20","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.: A new model for selfish routing. Theoret. Comput. Sci. 406(3), 187\u2013206 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR21","unstructured":"Meyers, C., Problems, N.F., Games, C.: Complexity and approximation results. Ph.D. thesis, MIT, Operations Research Center (2006)"},{"issue":"1","key":"9_CR22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games Econom. Behav. 13(1), 111\u2013124 (1996)","journal-title":"Games Econom. Behav."},{"key":"9_CR23","volume-title":"The Economics of Welfare","author":"AC Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan, London (1920)"},{"issue":"1","key":"9_CR24","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. Internat. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/net.3230030104","volume":"3","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: The network equilibrium problem in integers. Networks 3, 53\u201359 (1973)","journal-title":"Networks"},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. J. Comput. System Sci. 67, 341\u2013364 (2002)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"9_CR27","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"},{"issue":"1","key":"9_CR28","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47(1), 79\u201396 (2007)","journal-title":"Algorithmica"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-642-24829-0_22","volume-title":"Algorithmic Game Theory","author":"L Tran-Thanh","year":"2011","unstructured":"Tran-Thanh, L., Polukarov, M., Chapman, A., Rogers, A., Jennings, N.R.: On the existence of pure strategy nash equilibria in integer\u2013splittable weighted congestion games. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 236\u2013253. Springer, Heidelberg (2011)"},{"issue":"3","key":"9_CR30","first-page":"325","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 1(3), 325\u2013362 (1952)","journal-title":"Proc. Inst. Civ. Eng."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T05:54:11Z","timestamp":1568354051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}