{"id":"https://openalex.org/W2969497706","doi":"https://doi.org/10.1145/3357384.3358063","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","display_name":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","publication_year":2019,"publication_date":"2019-11-03","ids":{"openalex":"https://openalex.org/W2969497706","doi":"https://doi.org/10.1145/3357384.3358063","mag":"2969497706"},"language":"en","primary_location":{"id":"doi:10.1145/3357384.3358063","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357384.3358063","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357384.3358063","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357384.3358063","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kartik Lakhotia","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kartik Lakhotia","raw_affiliation_strings":["University of Southern California, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":null,"display_name":"David Kempe","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Kempe","raw_affiliation_strings":["University of Southern California, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7209,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70385476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"339","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9976999759674072,"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.9976999759674072,"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.9940000176429749,"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"}},{"id":"https://openalex.org/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8295000195503235},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8138999938964844},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6790000200271606},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6243000030517578},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5835000276565552},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5537999868392944},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45840001106262207},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.4499000012874603},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4348999857902527}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8295000195503235},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8138999938964844},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6790000200271606},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6243000030517578},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5835000276565552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5583999752998352},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5537999868392944},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45840001106262207},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.385699987411499},{"id":"https://openalex.org/C4727928","wikidata":"https://www.wikidata.org/wiki/Q17164759","display_name":"Social network (sociolinguistics)","level":3,"score":0.36959999799728394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35670000314712524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34139999747276306},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.3310000002384186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3292999863624573},{"id":"https://openalex.org/C34146451","wikidata":"https://www.wikidata.org/wiki/Q5048094","display_name":"Cascade","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.30970001220703125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3061000108718872},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C126831891","wikidata":"https://www.wikidata.org/wiki/Q221673","display_name":"Host (biology)","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2567000091075897}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3357384.3358063","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357384.3358063","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357384.3358063","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1908.09185","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1908.09185","pdf_url":"https://arxiv.org/pdf/1908.09185","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3357384.3358063","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357384.3358063","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357384.3358063","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6805300143","display_name":null,"funder_award_id":"72924-NS-MUR","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G7391130650","display_name":null,"funder_award_id":"1619458","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320316838","display_name":"Kempe Foundation","ror":null},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2969497706.pdf","grobid_xml":"https://content.openalex.org/works/W2969497706.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W93230813","https://openalex.org/W131619556","https://openalex.org/W808055529","https://openalex.org/W1495750374","https://openalex.org/W1599913669","https://openalex.org/W1875516392","https://openalex.org/W1989453388","https://openalex.org/W2007604989","https://openalex.org/W2035165116","https://openalex.org/W2042123098","https://openalex.org/W2089729462","https://openalex.org/W2108278206","https://openalex.org/W2108858998","https://openalex.org/W2110373679","https://openalex.org/W2124172444","https://openalex.org/W2132651631","https://openalex.org/W2132801025","https://openalex.org/W2144629587","https://openalex.org/W2160080718","https://openalex.org/W2160411082","https://openalex.org/W2187996512","https://openalex.org/W2402962589","https://openalex.org/W2757107770","https://openalex.org/W2949112927","https://openalex.org/W2962711478","https://openalex.org/W3020831476","https://openalex.org/W3022817735","https://openalex.org/W4211017427"],"related_works":[],"abstract_inverted_index":{"We":[0,99],"study":[1,100],"a":[2,11,36,53,77,118,132,146,171,187,193,232,274],"natural":[3],"model":[4],"of":[5,17,103,121,164,243,245,261,276,279,286,306],"coordinated":[6,92],"social":[7,12,122],"ad":[8,80,108,263],"campaigns":[9,81,264],"over":[10,84],"network,":[13,86],"based":[14],"on":[15,158],"models":[16],"Datta":[18],"et":[19,23],"al.":[20,24],"and":[21,174,223,283],"Aslay":[22],"Multiple":[25],"advertisers":[26,299],"are":[27,56,250],"willing":[28],"to":[29,35,61,71,89,95,114,130,136,170,180,230,240,257,311],"pay":[30],"the":[31,85,101,105,125,159,166,175,204,217,255,259,266,277,280,284,289,303,317],"host":[32],"-":[33,39,182,199,234],"up":[34],"known":[37],"budget":[38],"per":[40],"user":[41,67],"exposure,":[42],"whether":[43],"that":[44,116,185,214,294,316],"exposure":[45],"is":[46,113,155,190,207,320],"sponsored":[47,59,74],"or":[48],"organic":[49],"(i.e.,":[50],"shared":[51],"by":[52,192,252],"friend).":[54],"Campaigns":[55],"seeded":[57],"with":[58,93],"ads":[60],"some":[62],"users,":[63],"but":[64],"no":[65,156],"network":[66],"must":[68],"be":[69,90,128,143,178,228],"exposed":[70],"too":[72],"many":[73],"ads.":[75],"As":[76],"result,":[78],"while":[79],"proceed":[82],"independently":[83],"they":[87],"need":[88],"carefully":[91],"respect":[94,310],"their":[96],"seed":[97,161],"sets.":[98],"objective":[102],"maximizing":[104,131],"network's":[106],"total":[107],"revenue.":[109],"Our":[110,247,291],"main":[111],"result":[112],"show":[115,213,315],"under":[117,216],"broad":[119],"class":[120],"influence":[123,281],"models,":[124],"problem":[126,206],"can":[127,141,177,227],"reduced":[129],"submodular":[133],"function":[134,275],"subject":[135],"two":[137],"matroid":[138],"constraints;":[139],"it":[140],"therefore":[142],"approximated":[144],"within":[145],"factor":[147,188],"essentially":[148],"1/2":[149,189],"in":[150,184,288,322],"polynomial":[151],"time.":[152],"When":[153],"there":[154],"bound":[157],"individual":[160,271],"set":[162],"sizes":[163],"advertisers,":[165],"constraints":[167],"correspond":[168],"only":[169],"single":[172],"matroid,":[173],"guarantee":[176],"improved":[179],"1":[181,198,233],"1/e;":[183],"case,":[186],"achieved":[191],"practical":[194],"greedy":[195],"algorithm.":[196],"The":[197],"1/e":[200,235],"approximation":[201,236],"algorithm":[202,237],"for":[203,297],"matroid-constrained":[205],"far":[208],"from":[209,269],"practical;":[210],"however,":[211],"we":[212,314],"specifically":[215],"Independent":[218],"Cascade":[219],"model,":[220],"LP":[221],"rounding":[222],"Reverse":[224],"Reachability":[225],"techniques":[226],"combined":[229],"obtain":[231],"which":[238,258],"scales":[239],"several":[241],"tens":[242],"thousands":[244],"nodes.":[246],"theoretical":[248],"results":[249],"complemented":[251],"experiments":[253,292],"evaluating":[254],"extent":[256],"coordination":[260],"multiple":[262],"inhibits":[265],"revenue":[267],"obtained":[268],"each":[270],"campaign,":[272],"as":[273,295],"similarity":[278],"networks":[282,296],"strength":[285],"ties":[287],"network.":[290],"suggest":[293],"different":[298],"become":[300],"less":[301],"similar,":[302],"harmful":[304],"effect":[305],"competition":[307],"decreases.":[308],"With":[309],"tie":[312],"strengths,":[313],"most":[318],"harm":[319],"done":[321],"an":[323],"intermediate":[324],"range.":[325]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-08-29T00:00:00"}