{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:09:17Z","timestamp":1743156557441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031393433"},{"type":"electronic","value":"9783031393440"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-39344-0_8","type":"book-chapter","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:27:10Z","timestamp":1692995230000},"page":"105-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Core Allocations for\u00a0Edge Cover Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8137-8149","authenticated-orcid":false,"given":"Tianhang","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7893-4028","authenticated-orcid":false,"given":"Han","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,26]]},"reference":[{"key":"8_CR1","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. AC, vol. 24. Springer, Berlin (2003)"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"ML Balinski","year":"1965","unstructured":"Balinski, M.L.: Integer programming: methods, uses, computations. Manag. Sci. 12(3), 253\u2013313 (1965)","journal-title":"Manag. Sci."},{"issue":"6","key":"8_CR3","first-page":"1","volume":"5","author":"G Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. Synth. Lect. Artif. Intell. Mach. Learn. 5(6), 1\u2013168 (2011)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G.: Combinatorial Optimization: Packing and Covering. SIAM (2001)","key":"8_CR4","DOI":"10.1137\/1.9780898717105"},{"unstructured":"Carr, R., Vempala, S.: Towards a $$\\frac{4}{3}$$ approximation for the asymmetric traveling salesman problem. In: SODA, pp. 116\u2013125 (2000)","key":"8_CR5"},{"issue":"3","key":"8_CR6","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."},{"unstructured":"Edmonds, J.: Matching: a well-solved class of integer programs. Combinatorial Structures and their Applications, pp. 89\u201392 (1970)","key":"8_CR7"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01545526","volume":"20","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Fekete, S.P., Hochst\u00e4ttler, W., Kern, W.: On approximately fair cost allocation in Euclidean TSP games. Oper. Res. Spektrum 20(1), 29\u201337 (1998)","journal-title":"Oper. Res. Spektrum"},{"issue":"2","key":"8_CR9","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(2), 141\u2013152 (1993)","journal-title":"Z. Oper. Res."},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/S0895480296308074","volume":"11","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Kern, W.: Approximate core allocation for binpacking games. SIAM J. Discret. Math. 11(3), 387\u2013399 (1998)","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"8_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02680558","volume":"83","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Kern, W., Fekete, S.P., Hochst\u00e4ttler, W.: The nucleon of cooperative games and an algorithm for matching games. Math. Program. 83(1\u20133), 195\u2013211 (1998)","journal-title":"Math. Program."},{"issue":"40","key":"8_CR12","first-page":"47","volume":"4","author":"DB Gillies","year":"1959","unstructured":"Gillies, D.B.: Solutions to general non-zero-sum games. Contrib. Theory Games 4(40), 47\u201385 (1959)","journal-title":"Contrib. Theory Games"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0196-6774(03)00098-1","volume":"50","author":"MX Goemans","year":"2004","unstructured":"Goemans, M.X., Skutella, M.: Cooperative facility location games. J. Algorithms 50(2), 194\u2013214 (2004)","journal-title":"J. Algorithms"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.1007\/s00453-022-00949-5","volume":"84","author":"D Huang","year":"2022","unstructured":"Huang, D., Pettie, S.: Approximate generalized matching: $$f$$-factors and $$f$$-edge covers. Algorithmca 84, 1952\u20131992 (2022)","journal-title":"Algorithmca"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Kern, W., Paulusma, D.: On the core and f-nucleolus of flow games. Math. Oper. Res. 12 (2009)","key":"8_CR16","DOI":"10.1287\/moor.1090.0405"},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.orl.2012.06.007","volume":"40","author":"W Kern","year":"2012","unstructured":"Kern, W., Qiu, X.: Integrality gap analysis for bin packing games. Oper. Res. Lett. 40(5), 360\u2013363 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"8_CR18","first-page":"4661","volume":"12","author":"HK Kim","year":"2016","unstructured":"Kim, H.K.: Note on fractional edge covering games. Glob. J. Pure Appl. Math. 12(6), 4661\u20134675 (2016)","journal-title":"Glob. J. Pure Appl. Math."},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/0377-2217(83)90197-2","volume":"12","author":"A Kolen","year":"1983","unstructured":"Kolen, A.: Solving covering problems and the uncapacitated plant location problem on trees. Eur. J. Oper. Res. 12(3), 266\u2013278 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"8_CR20","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."},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G Nemhauser","year":"1975","unstructured":"Nemhauser, G., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8(1), 232\u2013248 (1975)","journal-title":"Math. Program."},{"key":"8_CR22","volume-title":"A Course in Game Theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1007\/s10878-012-9484-9","volume":"26","author":"B Park","year":"2013","unstructured":"Park, B., Kim, S.R., Kim, H.K.: On the cores of games arising from integer edge covering functions of graphs. J. Comb. Optim. 26(4), 786\u2013798 (2013)","journal-title":"J. Comb. Optim."},{"key":"8_CR24","volume-title":"Introduction to the Theory of Cooperative Games","author":"B Peleg","year":"2007","unstructured":"Peleg, B., Sudh\u00f6lter, P.: Introduction to the Theory of Cooperative Games, vol. 34. Springer, Heidelberg (2007)"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01585702","volume":"53","author":"JA Potters","year":"1992","unstructured":"Potters, J.A., Curiel, I.J., Tijs, S.H.: Traveling salesman games. Math. Program. 53(1), 199\u2013211 (1992)","journal-title":"Math. Program."},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.02.018","volume":"627","author":"X Qiu","year":"2016","unstructured":"Qiu, X., Kern, W.: Approximate core allocations and integrality gap for the bin packing game. Theor. Comput. Sci. 627, 26\u201335 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"8_CR27","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.orl.2015.04.008","volume":"43","author":"L Sun","year":"2015","unstructured":"Sun, L., Karwan, M.H.: On the core of traveling salesman games. Oper. Res. Lett. 43(4), 365\u2013369 (2015)","journal-title":"Oper. Res. Lett."},{"key":"8_CR28","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 Econom. Behav. 132, 478\u2013486 (2022)","journal-title":"Games Econom. Behav."},{"issue":"6","key":"8_CR29","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.orl.2004.02.004","volume":"32","author":"B van Velzen","year":"2004","unstructured":"van Velzen, B.: Dominating set games. Oper. Res. Lett. 32(6), 565\u2013573 (2004)","journal-title":"Oper. Res. Lett."},{"unstructured":"Xiao, H., Lu, T., Fang, Q.: Approximate core allocations for multiple partners matching games. arXiv:2107.01442 (2021)","key":"8_CR30"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39344-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:27:59Z","timestamp":1692995279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39344-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031393433","9783031393440"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39344-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.cis.um.edu.mo\/ijtcs2023\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}