{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T07:12:44Z","timestamp":1758093164190,"version":"3.44.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171444","12301415"],"award-info":[{"award-number":["12171444","12301415"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2023QA011"],"award-info":[{"award-number":["ZR2023QA011"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10957-025-02806-1","type":"journal-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T04:07:37Z","timestamp":1755058057000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Cores of Submodular Cost Set Cover Games"],"prefix":"10.1007","volume":"207","author":[{"given":"Qingqin","family":"Nong","sequence":"first","affiliation":[]},{"given":"Jingyu","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Qin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1422-9155","authenticated-orcid":false,"given":"Suning","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,13]]},"reference":[{"key":"2806_CR1","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Springer Nature (2022)"},{"issue":"3","key":"2806_CR2","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"2806_CR3","unstructured":"Dughmi, S.: Submodular functions: Extensions, distributions, and algorithms. A survey. arXiv:0912.0322 (2009)"},{"key":"2806_CR4","unstructured":"Edelman, P.H.,Van der Linden, M., Weymark, J.A.: The core of a transferable utility game as the solution to a public good market demand problem. Mathematical Programming. pp. 1-16 (2024)"},{"key":"2806_CR5","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Optimization-Eureka, You Shrink! Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, France, March 5-9, 2001, Revised Papers, pp. 11-26. Springer, Berlin, Heidelberg (2003)","DOI":"10.1007\/3-540-36478-1_2"},{"key":"2806_CR6","first-page":"141","volume":"38","author":"U Faigle","year":"1993","unstructured":"Faigle, U., Kern, W.: On some approximately balanced combinatorial cooperative games. Z. Oper. Res. 38, 141\u2013152 (1993)","journal-title":"Z. Oper. Res."},{"key":"2806_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01582060","volume":"63","author":"JBG Frenk","year":"1994","unstructured":"Frenk, J.B.G., Gromicho, J., Zhang, S.: A deep cut ellipsoid algorithm for convex programming: Theory and applications. Math. Program. 63, 83\u2013108 (1994)","journal-title":"Math. Program."},{"key":"2806_CR8","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Elsevier (2005)"},{"key":"2806_CR9","doi-asserted-by":"crossref","unstructured":"Gillies, D.B.: Solutions to general non-zero-sum games. In: Contributions to the Theory of Games, vol. 4, pp. 47-85. Princeton University Press, Princeton (1959)","DOI":"10.1515\/9781400882168-005"},{"issue":"1","key":"2806_CR10","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10107-021-01716-0","volume":"203","author":"M Grabisch","year":"2024","unstructured":"Grabisch, M., Sudh\u00f6lter, P.: Characterization of TU games with stable cores by nested balancedness. Math. Program. 203(1), 801\u2013826 (2024)","journal-title":"Math. Program."},{"key":"2806_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF02592000","volume":"29","author":"D Granot","year":"1984","unstructured":"Granot, D., Huberman, G.: On the core and nucleolus of minimum cost spanning tree games. Math. Program. 29, 323\u2013347 (1984)","journal-title":"Math. Program."},{"issue":"1","key":"2806_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF01585160","volume":"62","author":"DS Hochbaum","year":"1993","unstructured":"Hochbaum, D.S., Megiddo, N., Naor, J., Tamir, A.: Tight bounds and $$2$$-approximation algorithms for integer programs with two variables per inequality. Math. Program. 62(1), 69\u201383 (1993)","journal-title":"Math. Program."},{"key":"2806_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10107-006-0084-2","volume":"112","author":"S Iwata","year":"2008","unstructured":"Iwata, S.: Submodular function minimization. Math. Program. 112, 45\u201364 (2008)","journal-title":"Math. Program."},{"key":"2806_CR14","doi-asserted-by":"crossref","unstructured":"Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 671-680. IEEE (2009)","DOI":"10.1109\/FOCS.2009.31"},{"issue":"3","key":"2806_CR15","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1287\/moor.7.3.476","volume":"7","author":"E Kalai","year":"1982","unstructured":"Kalai, E., Zemel, E.: Totally balanced games and games of flow. Math. Oper. Res. 7(3), 476\u2013478 (1982)","journal-title":"Math. Oper. Res."},{"key":"2806_CR16","unstructured":"Liu, P., Xiao, H., Fang, Q.: On the approximate core and nucleon of flow games. arXiv:2401.13535 (2024)"},{"issue":"10","key":"2806_CR17","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.aml.2006.09.011","volume":"20","author":"Y Liu","year":"2007","unstructured":"Liu, Y., Fang, Q.: Balancedness of edge covering games. Appl. Math. Lett. 20(10), 1064\u20131069 (2007)","journal-title":"Appl. Math. Lett."},{"key":"2806_CR18","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Mathematical Programming The State of the Art: Bonn 1982, pp. 235-257. Springer, Berlin, Heidelberg (1983)","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"2806_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114433","volume":"991","author":"T Lu","year":"2024","unstructured":"Lu, T., Xiao, H., Fang, Q.: Approximate core allocations for edge cover games. Theor. Comput. Sci. 991, 114433 (2024)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2806_CR20","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/moor.22.1.146","volume":"22","author":"H Nagamochi","year":"1997","unstructured":"Nagamochi, H., Zeng, D., Kabutoya, N., Ibaraki, T.: Complexity of the minimum base game on matroids. Math. Oper. Res. 22(1), 146\u2013164 (1997)","journal-title":"Math. Oper. Res."},{"key":"2806_CR21","volume-title":"A Course in Game Theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne, M.J.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"issue":"1","key":"2806_CR22","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G Owen","year":"1975","unstructured":"Owen, G.: On the core of linear production games. Math. Program. 9(1), 358\u2013370 (1975)","journal-title":"Math. Program."},{"key":"2806_CR23","doi-asserted-by":"crossref","unstructured":"Shubik, M.: Game theory models and methods in political economy. In: Handbook of Mathematical Economics, vol. 1, pp. 285-330. North-Holland (1981)","DOI":"10.1016\/S1573-4382(81)01011-4"},{"key":"2806_CR24","unstructured":"Tijs, S.: Bounds for the core of a game and the t-value. In: Game Theory and Mathematical Economics, pp. 123-132. North-Holland (1981)"},{"key":"2806_CR25","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.geb.2022.01.017","volume":"132","author":"VV Vazirani","year":"2022","unstructured":"Vazirani, V.V.: The general graph matching game: Approximate core. Games Econ. Behav. 132, 478\u2013486 (2022)","journal-title":"Games Econ. Behav."},{"key":"2806_CR26","unstructured":"Xiao, H., Lu, T., Fang, Q.: Approximate core allocations for multiple partners matching games. arXiv:2107.01442 (2021)"},{"key":"2806_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2023.111126","volume":"155","author":"L Ye","year":"2023","unstructured":"Ye, L., Liu, Z., Chi, M., Gupta, V.: Maximization of nonsubmodular functions under multiple constraints with applications. Automatica 155, 111126 (2023)","journal-title":"Automatica"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02806-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02806-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02806-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T07:43:48Z","timestamp":1758008628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02806-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,13]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2806"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02806-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,8,13]]},"assertion":[{"value":"13 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"53"}}