{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:22:33Z","timestamp":1725830553850},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662484326"},{"type":"electronic","value":"9783662484333"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48433-3_14","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T11:07:03Z","timestamp":1443092823000},"page":"178-189","source":"Crossref","is-referenced-by-count":4,"title":["On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"Drees","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Feldotto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"issue":"17","key":"14_CR1","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. Theoret. Comput. Sci. 410(17), 1552\u20131563 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/15427951.2008.10129170","volume":"5","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., Skopalik, A.: Complexity of pure Nash equilibria in player-specific network congestion games. Internet Math. 5(4), 323\u2013342 (2008)","journal-title":"Internet Math."},{"issue":"5","key":"14_CR3","doi-asserted-by":"publisher","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":"14_CR4","unstructured":"Anshelevich, E., Postl, J., Wexler, T.: Assignment games with conflicts: price of total anarchy and convergence results via semi-smoothness. In: CoRR abs\/1304.5149 (2013)"},{"key":"14_CR5","unstructured":"Augustine, J., Chen, N., Elkind, E., Fanelli, A., Gravin, N., Shiryaev, D.: Dynamics of profit-sharing games. In: Proceedings of IJCAI, pp. 37\u201342. IJCAI\/AAAI (2011)"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/070702370","volume":"42","author":"B Awerbuch","year":"2013","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. SIAM J. Comput. 42(1), 160\u2013177 (2013)","journal-title":"SIAM J. Comput."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: Proceedings of EC, pp. 264\u2013273. ACM (2008)","DOI":"10.1145\/1386790.1386832"},{"issue":"4","key":"14_CR8","first-page":"14","volume":"2","author":"K Bhawalkar","year":"2014","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: the price of anarchy, universal worst-case examples, and tightness. ACM TEAC 2(4), 14 (2014)","journal-title":"ACM TEAC"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., S\u00fc\u00df, T.: Scheduling shared continuous resources on many-cores. In: Proceedings of 26th ACM SPAA, pp. 128\u2013137. ACM, New York (2014)","DOI":"10.1145\/2612669.2612698"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient computation of approximate pure Nash equilibria in congestion games. In: 52nd FOCS, pp. 532\u2013541. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.50"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. In: Proceedings of 13th EC, pp. 284\u2013301. ACM (2012)","DOI":"10.1145\/2229012.2229036"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H Chen","year":"2009","unstructured":"Chen, H., Roughgarden, T.: Network Design with Weighted Players. Theory Comput. Syst. 45(2), 302\u2013324 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S Chien","year":"2011","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. Games Econ. Behav. 71(2), 315\u2013327 (2011)","journal-title":"Games Econ. Behav."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of 37th STOC, pp. 67\u201373. ACM (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","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":"14_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-1-4615-0005-6_3","volume-title":"Handbook of Massive Data Sets, Massive Computing","author":"K Coffman","year":"2002","unstructured":"Coffman, K., Odlyzko, A.: Internet growth: is there a moores law for data traffic? In: Panos, J.A., Mauricio, M.P., Resende, G.C. (eds.) Handbook of Massive Data Sets, Massive Computing, vol. 4, pp. 47\u201393. Springer, New York (2002)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Drees, M., Feldotto, M., Riechers, S., Skopalik, A.: On existence and properties of approximate pure nash equilibria in bandwidth allocation games. In: CoRR abs\/1507.02908 (2015)","DOI":"10.1007\/978-3-662-48433-3_14"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-3-662-44803-8_10","volume-title":"Algorithmic Game Theory","author":"M Drees","year":"2014","unstructured":"Drees, M., Riechers, S., Skopalik, A.: Budget-restricted utility games with ordered strategic decisions. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 110\u2013121. Springer, Heidelberg (2014)"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","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":"14_CR20","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of 36th STOC, pp. 604\u2013612. ACM (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-319-13129-0_3","volume-title":"Web and Internet Economics","author":"M Feldotto","year":"2014","unstructured":"Feldotto, M., Gairing, M., Skopalik, A.: Bounding the potential function in congestion games and approximate pure Nash equilibria. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 30\u201343. Springer, Heidelberg (2014)"},{"issue":"5","key":"14_CR22","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"MX Goemans","year":"2006","unstructured":"Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in Ad-Hoc networks. IEEE J. Sel. Areas Commun. 24(5), 1020\u20131033 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"14_CR23","unstructured":"Hansknecht, C., Klimm, M., Skopalik, A.: Approximate pure Nash equilibria in weighted congestion games. In: APPROX\/RANDOM, pp. 242\u2013257 (2014)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-14165-2_8","volume-title":"Automata, Languages and Programming","author":"T Harks","year":"2010","unstructured":"Harks, T., Klimm, M.: On the existence of pure nash equilibria in weighted congestion games. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 79\u201389. Springer, Heidelberg (2010)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Harks, T., Klimm, M.: Congestion games with variable demands. In: Proceedings of 13th TARK, pp. 111\u2013120. ACM (2011)","DOI":"10.1145\/2000378.2000391"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Lucier, B., Leme, R.P.: GSP auctions with correlated types. In: Proceedings of 12th EC, pp. 71\u201380. ACM (2011)","DOI":"10.1145\/1993574.1993587"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-540-74456-6_56","volume-title":"Mathematical Foundations of Computer Science 2007","author":"M Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Milchtaich, I., Monien, B., Tiemann, K.: Congestion games with player-specific constants. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 633\u2013644. Springer, Heidelberg (2007)"},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","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 Econ. Behav. 13(1), 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"14_CR29","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 Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","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"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of 41st STOC, pp. 513\u2013522. ACM (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure nash equilibria. In: Proceedings of 40th STOC, pp. 355\u2013364. ACM (2008)","DOI":"10.1145\/1374376.1374428"}],"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-48433-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:38:36Z","timestamp":1559266716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48433-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662484326","9783662484333"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48433-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}