{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:28:36Z","timestamp":1753885716215,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U20A2068"],"award-info":[{"award-number":["U20A2068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771013"],"award-info":[{"award-number":["11771013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LD19A010001"],"award-info":[{"award-number":["LD19A010001"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LY19A010018"],"award-info":[{"award-number":["LY19A010018"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:p> In this paper, we propose a set cover game and show that any Nash equilibrium is a minimal set cover, and also a Pareto optimal solution. Then we present a distributed algorithm to realize the game. The algorithm is self-organizing in the sense that all players can make decisions by themselves simultaneously. It is local in the sense that each player makes his decision based only on information in his neighborhood. It is efficient in the sense that it converges to a minimal set cover in polynomial time when [Formula: see text] is upper bounded by a polynomial of the input size, where [Formula: see text] and [Formula: see text] are the maximum cost and the minimum cost of sets, respectively. <\/jats:p>","DOI":"10.1142\/s1793830921501275","type":"journal-article","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T03:43:32Z","timestamp":1618371812000},"source":"Crossref","is-referenced-by-count":0,"title":["A distributed algorithm for a set cover game"],"prefix":"10.1142","volume":"14","author":[{"given":"Chaojie","family":"Zhu","sequence":"first","affiliation":[{"name":"College of Mathematics and Computer Sciences, Zhejiang Normal University Jinhua, Zhejiang 321004, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0722-8852","authenticated-orcid":false,"given":"Xiaohui","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Computer Sciences, Zhejiang Normal University Jinhua, Zhejiang 321004, P. R. China"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Computer Sciences, Zhejiang Normal University Jinhua, Zhejiang 321004, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2021,5,24]]},"reference":[{"key":"S1793830921501275BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_30"},{"key":"S1793830921501275BIB002","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"S1793830921501275BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2004.08.004"},{"key":"S1793830921501275BIB004","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"S1793830921501275BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_52"},{"key":"S1793830921501275BIB006","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"volume-title":"Game Theory in Wireless and Communication Networks: Theory, Models, and Applications","year":"2012","author":"Han Z.","key":"S1793830921501275BIB007"},{"issue":"6","key":"S1793830921501275BIB008","first-page":"1275","volume":"22","author":"Kim H. K.","year":"2011","journal-title":"J. Korean Data Inf. Sci. Soc."},{"key":"S1793830921501275BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.09.024"},{"key":"S1793830921501275BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2817631"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T09:43:25Z","timestamp":1649756605000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921501275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":10,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1142\/S1793830921501275"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501275","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,5,24]]},"article-number":"2150127"}}