{"id":"https://openalex.org/W4321485290","doi":"https://doi.org/10.1145/3539597.3570433","title":"Learning and Maximizing Influence in Social Networks Under Capacity Constraints","display_name":"Learning and Maximizing Influence in Social Networks Under Capacity Constraints","publication_year":2023,"publication_date":"2023-02-22","ids":{"openalex":"https://openalex.org/W4321485290","doi":"https://doi.org/10.1145/3539597.3570433"},"language":"en","primary_location":{"id":"doi:10.1145/3539597.3570433","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3539597.3570433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining","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/A5084208139","display_name":"Pritish Chakraborty","orcid":"https://orcid.org/0000-0001-8875-5819"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pritish Chakraborty","raw_affiliation_strings":["Indian Institute of Technology, Bombay, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0001-8875-5819","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054697900","display_name":"Sayan Ranu","orcid":"https://orcid.org/0000-0003-4147-9372"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sayan Ranu","raw_affiliation_strings":["Indian Institute of Technology, Delhi, New Delhi, India"],"raw_orcid":"https://orcid.org/0000-0003-4147-9372","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062565477","display_name":"Krishna Sri Ipsit Mantri","orcid":"https://orcid.org/0000-0002-2393-2834"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Krishna Sri Ipsit Mantri","raw_affiliation_strings":["Indian Institute of Technology, Bombay, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0002-2393-2834","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026269420","display_name":"Abir De","orcid":"https://orcid.org/0000-0002-9062-3636"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abir De","raw_affiliation_strings":["Indian Institute of Technology, Bombay, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0002-9062-3636","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"733","last_page":"741"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9976000189781189,"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.9976000189781189,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9891703128814697},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.6241718530654907},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.6232476830482483},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6224794983863831},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6082261800765991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6052504777908325},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5863796472549438},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5774411559104919},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.5700875520706177},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5609106421470642},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47874516248703003},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44136402010917664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30853602290153503},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15079280734062195}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9891703128814697},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.6241718530654907},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.6232476830482483},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6224794983863831},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6082261800765991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6052504777908325},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5863796472549438},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5774411559104919},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.5700875520706177},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5609106421470642},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47874516248703003},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44136402010917664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30853602290153503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15079280734062195},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3539597.3570433","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3539597.3570433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W136235603","https://openalex.org/W1576820654","https://openalex.org/W1875516392","https://openalex.org/W1984069252","https://openalex.org/W1999101712","https://openalex.org/W2009305899","https://openalex.org/W2029316629","https://openalex.org/W2035165116","https://openalex.org/W2041157860","https://openalex.org/W2042123098","https://openalex.org/W2056609785","https://openalex.org/W2061820396","https://openalex.org/W2073902783","https://openalex.org/W2108278206","https://openalex.org/W2132801025","https://openalex.org/W2160411082","https://openalex.org/W2424898826","https://openalex.org/W2612735401","https://openalex.org/W2798654119","https://openalex.org/W3104370314","https://openalex.org/W3106318401","https://openalex.org/W3202610621","https://openalex.org/W4213009331","https://openalex.org/W4288366087","https://openalex.org/W4301207233"],"related_works":["https://openalex.org/W4313349761","https://openalex.org/W2382791850","https://openalex.org/W2901206941","https://openalex.org/W2968699064","https://openalex.org/W4300407000","https://openalex.org/W3204684126","https://openalex.org/W2592313125","https://openalex.org/W2944632132","https://openalex.org/W2735578456","https://openalex.org/W4296167846"],"abstract_inverted_index":{"Influence":[0],"maximization":[1],"(IM)":[2],"refers":[3],"to":[4,23,60,72,86,120,123,159],"the":[5,27,34,42,76,89,114,126,146,151,160,177,192,196],"problem":[6,116,142],"of":[7,11,65,78,113,128,130,134,162,179,194],"finding":[8],"a":[9,14,56,96,102,111,131,169,184,201],"subset":[10,133],"nodes":[12,25,40],"in":[13,26,51],"network":[15],"through":[16],"which":[17,156],"we":[18,109,118,157,167],"could":[19],"maximize":[20,41,125],"our":[21,174],"reach":[22,121],"other":[24,74],"network.":[28],"This":[29],"set":[30,203],"is":[31,92],"often":[32],"called":[33],"\"seed":[35],"set\",":[36],"and":[37,69,99,124],"its":[38],"constituent":[39],"social":[43],"diffusion":[44],"process.":[45],"IM":[46,115,153],"has":[47,83,95,101],"previously":[48],"been":[49,85],"studied":[50],"various":[52],"settings,":[53],"including":[54],"under":[55],"time":[57],"deadline,":[58],"subject":[59,71],"constraints":[61],"such":[62],"as":[63,150,204],"that":[64,88,140,172,188],"budget":[66],"or":[67,94],"coverage,":[68],"even":[70],"measures":[73],"than":[75],"centrality":[77],"nodes.":[79],"The":[80],"solution":[81],"approach":[82],"generally":[84],"prove":[87],"objective":[90,175],"function":[91],"submodular,":[93],"submodular":[97,148,164],"proxy,":[98],"thus":[100],"close":[103],"greedy":[104,170],"approximation.":[105],"In":[106],"this":[107,141],"paper,":[108],"explore":[110],"variant":[112],"where":[117],"wish":[119],"out":[122],"probability":[127],"infection":[129],"small":[132],"bounded":[135],"capacity":[136],"K.":[137],"We":[138,181],"show":[139],"does":[143],"not":[144],"exhibit":[145],"same":[147],"guarantees":[149],"original":[152],"problem,":[154],"for":[155],"resort":[158],"theory":[161],"gamma-weakly":[163],"functions.":[165],"Subsequently,":[166],"develop":[168,183],"algorithm":[171],"maximizes":[173],"despite":[176],"lack":[178],"submodularity.":[180],"also":[182],"suitable":[185],"learning":[186],"model":[187],"out-competes":[189],"baselines":[190],"on":[191],"task":[193],"predicting":[195],"top-K":[197],"infected":[198],"nodes,":[199],"given":[200],"seed":[202],"input.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}