cs.SIOct 19, 2026

Optimizing Marketing Budgets for Social Influence: A Generalized Fractional Incentives Framework

Authors: Abhishek K. Umrawal, Akhil Bhimaraju, Eliot W. Robson, Lav R. Varshney

Organizations: University of Illinois Urbana-Champaign, Urbana, IL 61801, USA · Narmi, New York, NY 10016, USA · Stony Brook University, Stony Brook, NY 11794 USA

Abstract

Marketing managers routinely allocate limited budgets across individuals in social networks whose responsiveness and influence vary substantially. We study the problem of Budgeted Generalized Fractional Influence Maximization (BGFIM), which captures the allocation of continuous levels of marketing spend across users in the presence of heterogeneous response and network spillovers. In this framework, adoption probabilities are governed by user-specific response functions that capture both baseline propensity and marginal responsiveness, while incentive costs vary across users. We propose a scalable solution approach based on a discrete greedy procedure with provable approximation guarantees, enabling tractable optimization under realistic budget constraints. Our formulation generalizes prior influence maximization models by allowing heterogeneous response and cost structures, providing a more flexible representation of targeted marketing interventions. Using experiments on multiple large-scale networks, we show that continuous allocation strategies can outperform standard heuristics and improve influence outcomes under heterogeneous conditions, and we illustrate how the framework can support profit-oriented decision making by identifying budget levels that balance marginal returns and costs. Overall, our results highlight the value of fine-grained budget allocation in networked marketing environments and offer a scalable approach for data-driven marketing resource allocation.

Figures & tables

Explore similar work

CardsList
  1. Budgeted Online Influence Maximization

    Apr 21, 2026Pierre Perrault, Jennifer Healey, Zheng Wen +1Influence MaximizationSocial Network Analysis

  2. Revealing graph bandits for maximizing local influence

    May 1, 2026Alexandra Carpentier, Michal ValkoMulti-Armed BanditsGraph Bandits

  3. Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation

    Jul 13, 2025Yan Dai, Negin Golrezaei, Patrick JailletPrimal-Dual OptimizationOnline Convex Optimization