{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:34Z","timestamp":1740122374988,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP20K11699","JP24K14828"],"award-info":[{"award-number":["JP20K11699","JP24K14828"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10878-024-01218-7","type":"journal-article","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T18:01:26Z","timestamp":1728669686000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A common generalization of budget games and congestion games"],"prefix":"10.1007","volume":"48","author":[{"given":"Fuga","family":"Kiyosue","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7662-7374","authenticated-orcid":false,"given":"Kenjiro","family":"Takazawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,11]]},"reference":[{"issue":"17","key":"1218_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. https:\/\/doi.org\/10.1016\/j.tcs.2008.12.035","journal-title":"Theor Comput Sci"},{"key":"1218_CR2","doi-asserted-by":"publisher","unstructured":"Drees M, Feldotto M, Riechers S, Skopalik A (2015) On existence and properties of approximate pure Nash equilibria in bandwidth allocation games. In: Hoefer M (ed) 8th International Symposium on Algorithmic Game Theory, SAGT 2015. Lecture Notes in Computer Science, vol.\u00a09347, pp. 178\u2013189. Springer. https:\/\/doi.org\/10.1007\/978-3-662-48433-3_14","DOI":"10.1007\/978-3-662-48433-3_14"},{"issue":"2","key":"1218_CR3","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/s10878-018-0269-7","volume":"37","author":"M Drees","year":"2019","unstructured":"Drees M, Feldotto M, Riechers S, Skopalik A (2019) Pure Nash equilibria in restricted budget games. J Comb Optim 37(2):620\u2013638. https:\/\/doi.org\/10.1007\/s10878-018-0269-7","journal-title":"J Comb Optim"},{"key":"1218_CR4","doi-asserted-by":"publisher","unstructured":"Drees M, Riechers S, Skopalik A (2014) Budget-restricted utility games with ordered strategic decisions. In: Lavi R (ed) 7th International Symposium on Algorithmic Game Theory, SAGT 2014. Lecture Notes in Computer Science, vol.\u00a08768, pp. 110\u2013121. Springer. https:\/\/doi.org\/10.1007\/978-3-662-44803-8_10","DOI":"10.1007\/978-3-662-44803-8_10"},{"issue":"3","key":"1218_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.orl.2015.04.002","volume":"43","author":"S Fujishige","year":"2015","unstructured":"Fujishige S, Goemans MX, Harks T, Peis B, Zenklusen R (2015) Congestion games viewed from M-convexity. Oper Res Lett 43(3):329\u2013333. https:\/\/doi.org\/10.1016\/j.orl.2015.04.002","journal-title":"Oper Res Lett"},{"issue":"3","key":"1218_CR6","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1287\/moor.2016.0825","volume":"42","author":"S Fujishige","year":"2017","unstructured":"Fujishige S, Goemans MX, Harks T, Peis B, Zenklusen R (2017) Matroids are immune to Braess\u2019 paradox. Math Oper Res 42(3):745\u2013761. https:\/\/doi.org\/10.1287\/moor.2016.0825","journal-title":"Math Oper Res"},{"issue":"2","key":"1218_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00182-012-0322-1","volume":"42","author":"T Harks","year":"2013","unstructured":"Harks T, Klimm M, M\u00f6hring RH (2013) Strong equilibria in games with the lexicographical improvement property. Int J Game Theory 42(2):461\u2013482. https:\/\/doi.org\/10.1007\/s00182-012-0322-1","journal-title":"Int J Game Theory"},{"issue":"3","key":"1218_CR8","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1137\/16M1107450","volume":"28","author":"T Harks","year":"2018","unstructured":"Harks T, Klimm M, Peis B (2018) Sensitivity analysis for convex separable optimization over integral polymatroids. SIAM J Optim 28(3):2222\u20132245. https:\/\/doi.org\/10.1137\/16M1107450","journal-title":"SIAM J Optim"},{"key":"1218_CR9","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:124\u2013143. https:\/\/doi.org\/10.1006\/game.1996.0044","journal-title":"Games Econ Behav"},{"key":"1218_CR10","doi-asserted-by":"crossref","unstructured":"Murota K (2003) Discrete convex analysis. Society for industrial and applied mathematics, Philadelphia","DOI":"10.1137\/1.9780898718508"},{"key":"1218_CR11","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:65\u201367. https:\/\/doi.org\/10.1007\/BF01737559","journal-title":"Int J Game Theory"},{"key":"1218_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316779309","volume-title":"Twenty lectures on algorithmic game theory","author":"T Roughgarden","year":"2016","unstructured":"Roughgarden T (2016) Twenty lectures on algorithmic game theory. Cambridge University Press"},{"key":"1218_CR13","volume-title":"Combinatorial optimization-polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization-polyhedra and efficiency. Springer, Heidelberg"},{"issue":"4","key":"1218_CR14","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/s10878-019-00435-9","volume":"38","author":"K Takazawa","year":"2019","unstructured":"Takazawa K (2019) Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function. J Comb Optim 38(4):1043\u20131065. https:\/\/doi.org\/10.1007\/s10878-019-00435-9","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01218-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01218-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01218-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:10:50Z","timestamp":1729192250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01218-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1218"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01218-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,10]]},"assertion":[{"value":"22 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. All authors read and approved the final manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal participants"}}],"article-number":"24"}}