{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:31Z","timestamp":1725563551588},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157806"},{"type":"electronic","value":"9783642157813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15781-3_3","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T11:40:03Z","timestamp":1283341203000},"page":"29-38","source":"Crossref","is-referenced-by-count":12,"title":["Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Harks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"3_CR1","doi-asserted-by":"publisher","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\u00a055(6), 1\u201322 (2008)","journal-title":"J. ACM"},{"issue":"17","key":"3_CR2","doi-asserted-by":"publisher","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. Theor. Comput. Sci.\u00a0410(17), 1552\u20131562 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Aumann, R.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games, vol.\u00a04 (1959)","DOI":"10.1515\/9781400882168-018"},{"issue":"6","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R. Banner","year":"2007","unstructured":"Banner, R., Orda, A.: Bottleneck routing games in communication networks. IEEE J. Selected Areas Comm.\u00a025(6), 1173\u20131179 (2007)","journal-title":"IEEE J. Selected Areas Comm."},{"key":"3_CR5","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: Proc. 18th Symp. Disc. Algorithms (SODA), pp. 169\u2013178 (2007)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck links, variable demand, and the tragedy of the commons. In: Proc. 17th Symp. Disc. Algorithms (SODA), pp. 668\u2013677 (2006)","DOI":"10.1145\/1109557.1109630"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput.\u00a0(15), 948\u2013957 (1986)","DOI":"10.1137\/0215066"},{"key":"3_CR8","unstructured":"Edmonds, J.: Matroid partition. In: Dantzig, G.B., Veinott, A.F. (eds.) Mathematics of the Decision Sciences, pp. 335\u2013345 (1968)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. 36th Symp. Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.C.: The directed subgraph homeomorphism problem. Theor. Comput. Sci.\u00a010, 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"H.N. Gabow","year":"1995","unstructured":"Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci.\u00a050(2), 259\u2013273 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-10841-9_43","volume-title":"Internet and Network Economics","author":"T. Harks","year":"2009","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Strong Nash equilibria in games with the lexicographical improvement property. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 463\u2013470. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"3_CR13","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 Econ. Behav.\u00a021(1-2), 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"key":"3_CR14","volume-title":"An engineering approach to computer networking: ATM networks, the Internet, and the telephone network","author":"S. Keshav","year":"1997","unstructured":"Keshav, S.: An engineering approach to computer networking: ATM networks, the Internet, and the telephone network. Addison-Wesley, Reading (1997)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jeth.1996.2203","volume":"72","author":"H. Konishi","year":"1997","unstructured":"Konishi, H., Le Breton, M., Weber, S.: Equilibria in a model with partial rivalry. J. Econ. Theory\u00a072(1), 225\u2013237 (1997)","journal-title":"J. Econ. Theory"},{"key":"3_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2002","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2002)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/11944874_30","volume-title":"Internet and Network Economics","author":"V. Mazalov","year":"2006","unstructured":"Mazalov, V., Monien, B., Schoppmann, F., Tiemann, K.: Wardrop equilibria and price of stability for bottleneck games with splittable traffic. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 331\u2013342. Springer, Heidelberg (2006)"},{"key":"3_CR18","unstructured":"Nash-Williams, C.: An application of matroids to graph theory. In: Rosenstiehl, P. (ed.) Theory of Graphs; Proc. Intl. Symp. Rome 1966, pp. 263\u2013265 (1967)"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TNET.2006.880179","volume":"14","author":"L. Qiu","year":"2006","unstructured":"Qiu, L., Yang, Y.R., Zhang, Y., Shenker, S.: On selfish routing in internet-like environments. IEEE\/ACM Trans. Netw.\u00a014(4), 725\u2013738 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"3_CR20","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. Intl. J. Game Theory\u00a02(1), 65\u201367 (1973)","journal-title":"Intl. J. Game Theory"},{"key":"3_CR21","volume-title":"Algorithmic Game Theory","author":"T. Roughgarden","year":"2007","unstructured":"Roughgarden, T.: Routing games. In: Nisan, N., Tardos, \u00c9., Roughgarden, T., Vazirani, V. (eds.) Algorithmic Game Theory, \u00a0ch. 18, Cambridge University Press, Cambridge (2007)"},{"key":"3_CR22","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proc. 40th Symp. Theory of Computing (STOC), pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15781-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T22:28:36Z","timestamp":1559514516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15781-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157806","9783642157813"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15781-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}