{"id":"https://openalex.org/W2478644023","doi":"https://doi.org/10.1109/infocom.2016.7524472","title":"Minimum cost seed set for competitive social influence","display_name":"Minimum cost seed set for competitive social influence","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2478644023","doi":"https://doi.org/10.1109/infocom.2016.7524472","mag":"2478644023"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101916194","display_name":"Yuqing Zhu","orcid":"https://orcid.org/0000-0002-8540-4586"},"institutions":[{"id":"https://openalex.org/I27825529","display_name":"California State University Los Angeles","ror":"https://ror.org/0294hxs80","country_code":"US","type":"education","lineage":["https://openalex.org/I27825529"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuqing Zhu","raw_affiliation_strings":["Department of Computer Science, California State University, Los Angeles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, California State University, Los Angeles","institution_ids":["https://openalex.org/I27825529"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083038336","display_name":"Deying Li","orcid":"https://orcid.org/0000-0002-7748-5427"},"institutions":[{"id":"https://openalex.org/I27825529","display_name":"California State University Los Angeles","ror":"https://ror.org/0294hxs80","country_code":"US","type":"education","lineage":["https://openalex.org/I27825529"]},{"id":"https://openalex.org/I78988378","display_name":"Renmin University of China","ror":"https://ror.org/041pakw92","country_code":"CN","type":"education","lineage":["https://openalex.org/I78988378"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"Deying Li","raw_affiliation_strings":["College of Information, Renmin University of China","Department of Computer Science, California State University, Los Angeles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information, Renmin University of China","institution_ids":["https://openalex.org/I78988378"]},{"raw_affiliation_string":"Department of Computer Science, California State University, Los Angeles","institution_ids":["https://openalex.org/I27825529"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100423055","display_name":"Zhao Zhang","orcid":"https://orcid.org/0000-0003-4191-7598"},"institutions":[{"id":"https://openalex.org/I135237710","display_name":"Zhejiang Normal University","ror":"https://ror.org/01vevwk45","country_code":"CN","type":"education","lineage":["https://openalex.org/I135237710"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhao Zhang","raw_affiliation_strings":["Department of Computer Science, Zhejiang Normal University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Zhejiang Normal University","institution_ids":["https://openalex.org/I135237710"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.9339,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.98745998,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7594627141952515},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7558532953262329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6811445951461792},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.671922504901886},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6133607029914856},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5718422532081604},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5541087985038757},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.477934867143631},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4726979732513428},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4593333303928375},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.433102011680603},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33411210775375366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19871315360069275},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.18629363179206848}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7594627141952515},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7558532953262329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6811445951461792},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.671922504901886},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6133607029914856},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5718422532081604},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5541087985038757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.477934867143631},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4726979732513428},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4593333303928375},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.433102011680603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33411210775375366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19871315360069275},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.18629363179206848},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2016.7524472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W603975761","https://openalex.org/W1495750374","https://openalex.org/W1502487903","https://openalex.org/W1512602432","https://openalex.org/W1564025607","https://openalex.org/W1567923358","https://openalex.org/W1965759835","https://openalex.org/W1975750736","https://openalex.org/W1984069252","https://openalex.org/W1987316501","https://openalex.org/W2040938924","https://openalex.org/W2054863972","https://openalex.org/W2061820396","https://openalex.org/W2070199170","https://openalex.org/W2073415627","https://openalex.org/W2088747993","https://openalex.org/W2105509646","https://openalex.org/W2108278206","https://openalex.org/W2113735004","https://openalex.org/W2139297408","https://openalex.org/W2140426283","https://openalex.org/W2141403143","https://openalex.org/W2146591355","https://openalex.org/W2158204848","https://openalex.org/W2950924954","https://openalex.org/W2962961667","https://openalex.org/W4210390713","https://openalex.org/W6665006557"],"related_works":["https://openalex.org/W4367393448","https://openalex.org/W2896347948","https://openalex.org/W2402949237","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W4302557420","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W2968699064","https://openalex.org/W3204684126"],"abstract_inverted_index":{"We":[0,68,88,107],"wonder":[1],"that":[2,18,71,126,186],"in":[3,64,153],"a":[4,24,36,65,72,104],"competitive":[5],"environment,":[6],"how":[7,58],"an":[8,146],"influence":[9,20],"uses":[10],"the":[11,41,109,127],"minimum":[12],"cost":[13,183],"to":[14,56,97,135,185],"choose":[15],"seeds":[16],"such":[17],"its":[19,30],"spread":[21,75,132,152],"can":[22],"reach":[23],"desired":[25],"threshold":[26],"under":[27],"thwarting":[28],"from":[29],"competitors.":[31],"At":[32],"first":[33,44],"we":[34,144,171],"take":[35],"simple":[37,138,189],"fact":[38],"into":[39],"account:":[40],"information":[42,131,151],"arriving":[43],"has":[45],"heavy":[46],"impact,":[47],"and":[48,78,80,102,114,137,156],"present":[49],"Competitive":[50],"\u2014":[51],"Independent":[52],"Cascade":[53],"(C-IC)":[54],"model":[55],"characterize":[57],"different":[59],"influences":[60],"competing":[61],"with":[62,180,191],"others":[63],"social":[66,163],"network.":[67],"have":[69],"found":[70],"specific":[73],"influence's":[74],"is":[76,133,140],"monotone":[77],"submodular,":[79],"these":[81],"nice":[82],"properties":[83],"make":[84],"algorithm":[85,159,176],"performance":[86],"tractable.":[87],"then":[89],"propose":[90],"Minimum":[91],"Cost":[92],"Seed":[93],"Set":[94],"problem":[95],"(MinSeed)":[96],"answer":[98],"our":[99,174],"original":[100],"concern":[101],"give":[103,115],"greedy":[105,112,139],"algorithm.":[106],"analyze":[108],"ratio":[110],"of":[111,129],"algorithm,":[113],"result":[116],"significantly":[117],"better":[118],"than":[119],"similar":[120],"ones":[121],"analyzed":[122],"by":[123,188],"others.":[124],"Noticing":[125],"computation":[128],"real":[130,168],"hard":[134],"compute":[136],"too":[141],"time":[142],"consuming,":[143],"design":[145],"effective":[147],"method":[148],"for":[149,161],"estimating":[150],"C-IC":[154],"model,":[155],"devise":[157],"scalable":[158,175],"applying":[160],"large":[162],"networks.":[164],"Through":[165],"simulation":[166],"on":[167],"world":[169],"datasets,":[170],"confirm":[172],"that,":[173],"outputs":[177],"seed":[178],"set":[179],"small":[181],"total":[182],"comparable":[184],"given":[187],"greedy,":[190],"very":[192],"fast":[193],"computation.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}