{"id":"https://openalex.org/W7163998313","doi":"https://doi.org/10.48550/arxiv.2606.09623","title":"Constrained user-item allocation for e-commerce marketing campaigns","display_name":"Constrained user-item allocation for e-commerce marketing campaigns","publication_year":2026,"publication_date":"2026-06-08","ids":{"openalex":"https://openalex.org/W7163998313","doi":"https://doi.org/10.48550/arxiv.2606.09623"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.09623","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.09623","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.09623","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030602161","display_name":"Maja Lindstr\u00f6m","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lindstr\u00f6m, Maja","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119647046","display_name":"Natalija Glisovic","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Glisovic, Natalija","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138251245","display_name":"Jan von Pichowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"von Pichowski, Jan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035857033","display_name":"Tommy L\u00f6fstedt","orcid":"https://orcid.org/0000-0001-7119-7646"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L\u00f6fstedt, Tommy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038697749","display_name":"Martin Rosvall","orcid":"https://orcid.org/0000-0002-7181-9940"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rosvall, Martin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.5353999733924866,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.5353999733924866,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.11389999836683273,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.11089999973773956,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/pairwise-comparison","display_name":"Pairwise comparison","score":0.6710000038146973},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5979999899864197},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5848000049591064},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5799000263214111},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5666999816894531},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.487199991941452},{"id":"https://openalex.org/keywords/biclustering","display_name":"Biclustering","score":0.4778999984264374},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4659000039100647}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.680899977684021},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6710000038146973},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5979999899864197},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5848000049591064},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5799000263214111},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5666999816894531},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.487199991941452},{"id":"https://openalex.org/C144817290","wikidata":"https://www.wikidata.org/wiki/Q2976575","display_name":"Biclustering","level":5,"score":0.4778999984264374},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4659000039100647},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.40880000591278076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40610000491142273},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.36550000309944153},{"id":"https://openalex.org/C2779307704","wikidata":"https://www.wikidata.org/wiki/Q11794832","display_name":"Coupon","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.2985000014305115},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C2776678367","wikidata":"https://www.wikidata.org/wiki/Q31374404","display_name":"Shopping mall","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C23906176","wikidata":"https://www.wikidata.org/wiki/Q727515","display_name":"Affinity analysis","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.25870001316070557}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.09623","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.09623","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.09623","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.09623","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"When":[0],"running":[1],"marketing":[2],"campaigns,":[3],"retailers":[4],"must":[5],"decide":[6],"which":[7,12],"products":[8],"to":[9,14,74,93,118,145],"promote":[10],"and":[11,25,51,72,112,136,141,163],"users":[13,24,71],"target.":[15],"These":[16],"decisions":[17],"are":[18],"inherently":[19],"coupled:":[20],"effective":[21],"campaigns":[22],"match":[23],"items":[26,73],"with":[27,106],"strong":[28],"mutual":[29],"affinity":[30,100],"into":[31],"non-overlapping":[32],"groups":[33],"of":[34],"predefined":[35,41],"sizes.":[36],"However,":[37],"existing":[38],"approaches":[39],"assume":[40],"campaign":[42,54,65,160],"structure":[43],"or":[44],"decouple":[45],"item":[46],"selection":[47],"from":[48,57],"user":[49],"assignment,":[50],"cannot":[52],"discover":[53],"groupings":[55],"directly":[56],"joint":[58],"interaction":[59],"patterns.":[60],"We":[61,124],"therefore":[62],"formalize":[63],"this":[64,81],"problem":[66],"as":[67,148],"auto-targeting:":[68],"jointly":[69],"selecting":[70],"construct":[75],"multiple":[76],"disjoint":[77],"campaigns.":[78],"To":[79],"solve":[80],"combinatorial":[82,110],"problem,":[83],"we":[84],"propose":[85],"three":[86],"complementary":[87],"strategies:":[88],"(i)":[89],"constrained":[90],"spectral":[91],"biclustering":[92,155,167],"find":[94],"dense":[95],"regions":[96],"in":[97],"the":[98,132,143,158],"user-item":[99],"matrix,":[101],"(ii)":[102],"greedy":[103],"local":[104,120],"search":[105],"pairwise":[107],"swaps":[108],"for":[109],"refinement,":[111],"(iii)":[113],"a":[114,129,149,186],"multi-armed":[115],"bandit":[116],"framework":[117],"escape":[119],"optima":[121],"through":[122],"exploration.":[123],"evaluate":[125],"these":[126],"methods":[127,183],"on":[128,170,177],"synthetic":[130],"dataset,":[131],"Amazon":[133],"Reviews":[134],"benchmarks,":[135],"large-scale":[137],"proprietary":[138],"commercial":[139],"data,":[140],"compare":[142],"results":[144,152],"simulated":[146],"annealing":[147],"baseline.":[150],"The":[151],"show":[153],"that":[154],"consistently":[156],"achieves":[157],"highest":[159],"quality,":[161],"lift,":[162],"fairness":[164],"scores.":[165],"While":[166],"runs":[168],"efficiently":[169],"smaller":[171],"datasets,":[172],"its":[173],"runtime":[174],"increases":[175],"substantially":[176],"very":[178],"large":[179],"ones,":[180],"where":[181],"bandit-based":[182],"instead":[184],"offer":[185],"scalable":[187],"alternative.":[188]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-10T00:00:00"}