{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:02:43Z","timestamp":1746252163561,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319719238"},{"type":"electronic","value":"9783319719245"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71924-5_14","type":"book-chapter","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T13:16:52Z","timestamp":1511529412000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Feldotto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gairing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammateia","family":"Kotsialou","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":[[2017,11,25]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"25: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), 25:1\u201325:22 (2008)","journal-title":"J. ACM"},{"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."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11672142_17","volume-title":"STACS 2006","author":"S Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 218\u2013229. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_17"},{"key":"14_CR4","unstructured":"Aziz, H., de Keijzer, B.: Shapley meets shapley. In: Mayr, E.W., Portier, N. (eds.) 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, 5\u20138 March 2014, Lyon, France. LIPIcs, vol. 25, pp. 99\u2013111. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10458-009-9078-9","volume":"20","author":"Y Bachrach","year":"2010","unstructured":"Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices: theoretical and empirical analysis. Auton. Agent. Multi-Agent Syst. 20(2), 105\u2013122 (2010)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient computation of approximate pure Nash equilibria in congestion games. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22\u201325 October 2011, pp. 532\u2013541. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.50"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/2614687","volume":"3","author":"I Caragiannis","year":"2015","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Trans. Econ. Comput. 3(1), 2:1\u20132:32 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"2","key":"14_CR8","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_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 604\u2013612. ACM (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"2\u20133","key":"14_CR10","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.C., Spirakis, P.G.: Selfish unsplittable flows. Theor. Comput. Sci. 348(2\u20133), 226\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-662-47666-6_50","volume-title":"Automata, Languages, and Programming","author":"M Gairing","year":"2015","unstructured":"Gairing, M., Kollias, K., Kotsialou, G.: Tight bounds for cost-sharing in weighted congestion games. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 626\u2013637. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_50"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_42"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-13129-0_6","volume-title":"Web and Internet Economics","author":"V Gkatzelis","year":"2014","unstructured":"Gkatzelis, V., Kollias, K., Roughgarden, T.: Optimal cost-sharing in weighted congestion games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 72\u201388. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_6"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/moor.2014.0651","volume":"39","author":"R Gopalakrishnan","year":"2014","unstructured":"Gopalakrishnan, R., Marden, J.R., Wierman, A.: Potential games are necessary to ensure pure Nash equilibria in cost sharing games. Math. Oper. Res. 39(4), 1252\u20131296 (2014)","journal-title":"Math. Oper. Res."},{"key":"14_CR15","unstructured":"Hansknecht, C., Klimm, M., Skopalik, A.: Approximate pure Nash equilibria in weighted congestion games. In: Jansen, K., Rolim, J.D.P., Devanur, N.R., Moore, C. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2014, 4\u20136 September 2014, Barcelona, Spain. LIPIcs, vol. 28, pp. 242\u2013257. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/moor.1120.0543","volume":"37","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M.: On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res. 37(3), 419\u2013436 (2012)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"589","DOI":"10.2307\/1911054","volume":"57","author":"S Hart","year":"1989","unstructured":"Hart, S., Mas-Colell, A.: Potential, value, and consistency. Econometrica 57(3), 589\u2013614 (1989)","journal-title":"Econometrica"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-18173-8_20","volume-title":"Algorithms and Complexity","author":"M Klimm","year":"2015","unstructured":"Klimm, M., Schmand, D.: Sharing non-anonymous costs of multiple resources optimally. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 274\u2013287. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_20"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2781678","volume":"3","author":"K Kollias","year":"2015","unstructured":"Kollias, K., Roughgarden, T.: Restoring pure equilibria to weighted congestion games. ACM Trans. Econ. Comput. 3(4), 1\u201324 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-32241-9_48","volume-title":"Computing and Combinatorics","author":"D Liben-Nowell","year":"2012","unstructured":"Liben-Nowell, D., Sharp, A., Wexler, T., Woods, K.: Computing shapley value in supermodular coalitional games. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 568\u2013579. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32241-9_48"},{"key":"14_CR22","unstructured":"Maleki, S.: Addressing the computational issues of the Shapley value with applications in the smart grid. Ph.D. thesis, University of Southampton (2015)"},{"key":"14_CR23","unstructured":"Mann, I., Shapley, L.S.: Values of large games, 6: evaluating the electoral college exactly. Technical report, DTIC Document (1962)"},{"issue":"1","key":"14_CR24","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_CR25","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_CR26","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"},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2841228","volume":"4","author":"T Roughgarden","year":"2016","unstructured":"Roughgarden, T., Schrijvers, O.: Network Cost-Sharing without Anonymity. ACM Trans. Econ. Comput. 4(2), 8:1\u20138:24 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17\u201320 May 2008, pp. 355\u2013364. ACM (2008)","DOI":"10.1145\/1374376.1374428"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71924-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:52:23Z","timestamp":1709819543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71924-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319719238","9783319719245"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71924-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangalore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lcm.csa.iisc.ernet.in\/wine2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}