{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:40:02Z","timestamp":1748392802841,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_20","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"274-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Sharing Non-anonymous Costs of Multiple Resources Optimally"],"prefix":"10.1007","author":[{"given":"Max","family":"Klimm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Schmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H-L Chen","year":"2010","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput. 39(5), 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria. In: Babai, L., (ed.) Proc. 36th Annual ACM Sympos. Theory Comput., pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"2\u20133","key":"20_CR4","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., Spirakis, P.G.: Selfish unsplittable flows. Theoret. Comput. Sci. 348(2\u20133), 226\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR5","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, Heidelberg (2014)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci, pp. 142\u2013154 (2005)","DOI":"10.1109\/SFCS.2005.68"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Gopalakrishnan, R., Marden, J.R., Wierman, A.: Potential games are necessary to ensure pure nash equilibria in cost sharing games. In: Proc. 14th ACM Conf. Electronic Commerce, pp. 563\u2013564 (2013)","DOI":"10.1145\/2482540.2482553"},{"issue":"3","key":"20_CR8","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"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01756292","volume":"16","author":"E Kalai","year":"1987","unstructured":"Kalai, E., Samet, D.: On weighted shapley values. Internat. J. Game Theory 16(3), 205\u2013222 (1987)","journal-title":"Internat. J. Game Theory"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Klimm, M., Schmand, D.: Sharing non-anonymous costs of multiple resources optimally (2014). arXiv preprint arXiv:1412.4456","DOI":"10.1007\/978-3-319-18173-8_20"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-22012-8_43","volume-title":"Automata, Languages and Programming","author":"K Kollias","year":"2011","unstructured":"Kollias, K., Roughgarden, T.: Restoring pure equilibria to weighted congestion games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 539\u2013551. Springer, Heidelberg (2011)"},{"key":"20_CR12","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.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1016770831869","volume":"17","author":"L Libman","year":"2001","unstructured":"Libman, L., Orda, A.: Atomic resource sharing in noncooperative networks. Telecommun. Syst. 17(4), 385\u2013409 (2001)","journal-title":"Telecommun. Syst."},{"issue":"1","key":"20_CR14","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 Econom. Behav. 13(1), 111\u2013124 (1996)","journal-title":"Games Econom. Behav."},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Alogithms, games, and the Internet. In: Proc. 33th Annual ACM Sympos. Theory Comput., pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"issue":"1","key":"20_CR16","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. Internat. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-662-44803-8_12","volume-title":"Algorithmic Game Theory","author":"T Roughgarden","year":"2014","unstructured":"Roughgarden, T., Schrijvers, O.: Network cost-sharing without anonymity. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 134\u2013145. Springer, Heidelberg (2014)"},{"key":"20_CR18","unstructured":"Schulz, A.S., Stier-Moses, N.E.: On the performance of user equilibria in traffic networks. In: Proc. 14th Annual ACM-SIAM Sympos. on Discrete Algorithms, pp. 86\u201387. Society for Industrial and Applied Mathematics (2003)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A value for $$n$$-person games. In: Kuhn, H.W., Tucker, A.W. (ed.) Contributions to the Theory of Games, vol. 2, pp. 307\u2013317. Princeton University Press (1953)","DOI":"10.1515\/9781400881970-018"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/moor.1120.0567","volume":"38","author":"P von Falkenhausen","year":"2013","unstructured":"von Falkenhausen, P., Harks, T.: Optimal cost sharing for resource selection games. Math. Oper. Res. 38(1), 184\u2013208 (2013)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:14:37Z","timestamp":1748391277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}