{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:22Z","timestamp":1740122422724,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,3,17]],"date-time":"2018-03-17T00:00:00Z","timestamp":1521244800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10878-018-0269-7","type":"journal-article","created":{"date-parts":[[2018,3,17]],"date-time":"2018-03-17T06:47:34Z","timestamp":1521269254000},"page":"620-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Pure Nash equilibria in restricted budget games"],"prefix":"10.1007","volume":"37","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":[[2018,3,17]]},"reference":[{"issue":"17","key":"269_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 (2009) Pure Nash equilibria in player-specific and weighted congestion games. Theor Comput Sci 410(17):1552\u20131563","journal-title":"Theor Comput Sci"},{"issue":"4","key":"269_CR2","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 E, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J Comput 38(4):1602\u20131623","journal-title":"SIAM J Comput"},{"key":"269_CR3","doi-asserted-by":"crossref","unstructured":"Byde A, Polukarov M, Jennings NR (2009) Games with congestion-averse utilities. In: Algorithmic game theory: second international symposium. Springer, Berlin, pp 220\u2013232","DOI":"10.1007\/978-3-642-04645-2_20"},{"issue":"1","key":"269_CR4","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 (2015) Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Trans Econ Comput 3(1):2:1\u20132:32","journal-title":"ACM Trans Econ Comput"},{"issue":"2","key":"269_CR5","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 (2011) Convergence to approximate Nash equilibria in congestion games. Games Econ Behav 71(2):315\u2013327","journal-title":"Games Econ Behav"},{"key":"269_CR6","doi-asserted-by":"crossref","unstructured":"Drees M, Riechers S, Skopalik A (2014) Budget-restricted utility games with ordered strategic decisions. In: Proceedings of the 7th international symposium on algorithmic game theory. Springer, Berlin, pp 110\u2013121","DOI":"10.1007\/978-3-662-44803-8_10"},{"key":"269_CR7","doi-asserted-by":"crossref","unstructured":"Drees M, Feldotto M, Riechers S, Skopalik A (2015) On existence and properties of approximate pure Nash equilibria in bandwidth allocation games. In: Proceedings of the 8th international symposium on algorithmic game theory. Springer, Berlin, pp 178\u2013189","DOI":"10.1007\/978-3-662-48433-3_14"},{"key":"269_CR8","doi-asserted-by":"crossref","unstructured":"Gairing M, Klimm M (2013) Congestion games with player-specific costs revisited. In: Proceedings of the 6th international symposium on algorithmic game theory. Springer, Berlin, pp 98\u2013109","DOI":"10.1007\/978-3-642-41392-6_9"},{"key":"269_CR9","unstructured":"Hansknecht C, Klimm M, Skopalik A (2014) Approximate pure Nash equilibria in weighted congestion games. In: Proceedings of the 17th international workshop on approximation algorithms for combinatorial optimization problems. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, pp 242\u2013257"},{"key":"269_CR10","doi-asserted-by":"crossref","unstructured":"Harks T, Klimm M (2010) On the existence of pure Nash equilibria in weighted congestion games. In: Proceedings of the 38th international colloquium on automata, languages and programming. Springer, Berlin, pp 79\u201389","DOI":"10.1007\/978-3-642-14165-2_8"},{"issue":"1","key":"269_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1287\/moor.2015.0726","volume":"41","author":"T Harks","year":"2015","unstructured":"Harks T, Klimm M (2015) Congestion games with variable demands. Math Oper Res 41(1):255\u2013277","journal-title":"Math Oper Res"},{"key":"269_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1017\/CBO9780511800481.017","volume":"15","author":"K Jain","year":"2007","unstructured":"Jain K, Mahdian M (2007) Cost sharing. Algorithmic Game Theory 15:385\u2013410","journal-title":"Algorithmic Game Theory"},{"issue":"4","key":"269_CR13","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2781678","volume":"3","author":"K Kollias","year":"2015","unstructured":"Kollias K, Roughgarden T (2015) Restoring pure equilibria to weighted congestion games. ACM Trans Econ Comput 3(4):21:1\u201321:24","journal-title":"ACM Trans Econ Comput"},{"key":"269_CR14","doi-asserted-by":"crossref","unstructured":"Mavronicolas M, Milchtaich I, Monien B, Tiemann K (2007) Congestion games with player-specific constants. In: Proceedings of the 32nd international conference on mathematical foundations of computer science, pp 633\u2013644","DOI":"10.1007\/978-3-540-74456-6_56"},{"issue":"1","key":"269_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich I (1996) Congestion games with player-specific payoff functions. Games Econ Behav 13(1):111\u2013124","journal-title":"Games Econ Behav"},{"issue":"1","key":"269_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1):124\u2013143","journal-title":"Games Econ Behav"},{"issue":"1","key":"269_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2(1):65\u201367","journal-title":"Int J Game Theory"},{"key":"269_CR18","unstructured":"Shapley LS (1952) A value for n-person games. Technical report, DTIC Document"},{"key":"269_CR19","doi-asserted-by":"crossref","unstructured":"Voice T, Polukarov M, Byde A, Jennings NR (2009) On the impact of strategy and utility structures on congestion-averse games. In: Proceedings of the 5th international conference on web and internet economics. Springer, Berlin, pp 600\u2013607","DOI":"10.1007\/978-3-642-10841-9_61"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0269-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0269-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0269-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T20:50:38Z","timestamp":1552769438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0269-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,17]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["269"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0269-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,3,17]]},"assertion":[{"value":"17 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}