{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:19:25Z","timestamp":1766269165173,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Science Fund for Distinguished Young Scholar of China","award":["61425019"],"award-info":[{"award-number":["61425019"]}]},{"name":"Key Projects of National Natural Science Foundation of China","award":["71731004"],"award-info":[{"award-number":["71731004"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503342"],"award-info":[{"award-number":["61503342"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY16F030002"],"award-info":[{"award-number":["LY16F030002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tcyb.2017.2754919","type":"journal-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T14:04:05Z","timestamp":1508940245000},"page":"2994-3005","source":"Crossref","is-referenced-by-count":38,"title":["Asymmetric Game: A Silver Bullet to Weighted Vertex Cover of Networks"],"prefix":"10.1109","volume":"48","author":[{"given":"Changbing","family":"Tang","sequence":"first","affiliation":[]},{"given":"Ang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2014.2313374"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1038\/nature07921"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.3.751"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.02.005"},{"key":"ref31","first-page":"175","article-title":"Selfish service installation in networks","author":"cardinal","year":"2006","journal-title":"Proceedings of Internet and Network Economics"},{"key":"ref30","first-page":"18","article-title":"Measure and conquer: A simple \n$O(2^{0.288n})$\n independent set algorithm","author":"fomin","year":"2006","journal-title":"Proc of ACM-SIAM Symp Discrete Algorithms"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1142\/S0219198907001655"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/srep04590"},{"key":"ref35","first-page":"2757","article-title":"An evolutionary game optimization to vertex cover of dynamic networks","author":"li","year":"2014","journal-title":"Proc 33rd Chin Control Conf"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2218805"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.09.003"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s11427-014-4653-y"},{"key":"ref11","first-page":"592","article-title":"Modeling the communication problem in wireless sensor networks as a vertex cover","author":"safar","year":"2007","journal-title":"Proc IEEE\/ACM Int Conf Comput Syst Appl"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014362"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700381097"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.12.001"},{"key":"ref17","first-page":"1043","article-title":"A better approximation ratio for the vertex cover problem","author":"karakostas","year":"2005","journal-title":"Proc Int Colloq Automata Lang Program (ICALP)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.86.1658"},{"key":"ref19","first-page":"939","article-title":"Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem","author":"li","year":"2013","journal-title":"Proc IEEE Int Conf Tools Artif Intell"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11434-013-5810-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2283743"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2003.1228503"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2386799"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.07.016"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2010.2092763"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.262"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2010.2040733"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.228701"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-642-10841-9_18","article-title":"Covering game: Approximation through non-cooperation","author":"gairing","year":"2009","journal-title":"Proceedings of Internet and Network Economics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_52"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.2307\/2951778"},{"key":"ref24","first-page":"466","article-title":"Evolutionary dynamics of an asymmetric game between a supplier and a retailer","volume":"4222","author":"min","year":"2006","journal-title":"Proc Adv Nat Comput (ICNC)"},{"journal-title":"Individual Strategy and Social Structure An Evolutionary Theory of Institutions","year":"2001","author":"young","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1593279"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.04.003"},{"key":"ref26","first-page":"127","article-title":"Asymmetric game design and player location: An empirical study on mobile play experiences","author":"feng","year":"2013","journal-title":"Proc 18th Int Conf Comput Games"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/87\/60004"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8466053\/08068252.pdf?arnumber=8068252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:28:59Z","timestamp":1642004939000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8068252\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":45,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2017.2754919","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"type":"print","value":"2168-2267"},{"type":"electronic","value":"2168-2275"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}