English
Related papers

Related papers: Contextual Bandits for Advertising Campaigns: A Di…

200 papers

We consider contextual linear bandits over networks, a class of sequential decision-making problems where learning occurs simultaneously across multiple locations and the reward distributions share structural similarities while also…

Machine Learning · Computer Science 2025-08-26 Chuyun Deng , Huiwen Jia

In this work, we investigate the online influence maximization in social networks. Most prior research studies on online influence maximization assume that the nodes are fully cooperative and act according to their stochastically generated…

Social and Information Networks · Computer Science 2024-10-01 Xiaotong Cheng , Behzad Nourani-Koliji , Setareh Maghsudi

Interference, a key concept in causal inference, extends the reward modeling process by accounting for the impact of one unit's actions on the rewards of others. In contextual bandit (CB) settings, where multiple units are present in the…

Machine Learning · Computer Science 2024-09-25 Yang Xu , Wenbin Lu , Rui Song

The problem of Profit Maximization asks to choose a limited number of influential users from a given social network such that the initial activation of these users maximizes the profit earned at the end of the diffusion process. This…

Social and Information Networks · Computer Science 2026-02-03 Poonam Sharma , Suman Banerjee

This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is…

Social and Information Networks · Computer Science 2018-07-23 Marco Cremonini , Francesca Casamassima

Information diffusion and influence maximization are important and extensively studied problems in social networks. Various models and algorithms have been proposed in the literature in the context of the influence maximization problem. A…

Computer Science and Game Theory · Computer Science 2015-03-18 Mayur Mohite , Y. Narahari

We introduce a new budgeted framework for online influence maximization, considering the total cost of an advertising campaign instead of the common cardinality constraint on a chosen influencer set. Our approach better models the…

Machine Learning · Computer Science 2026-04-22 Pierre Perrault , Jennifer Healey , Zheng Wen , Michal Valko

Contextual linear bandits is a rich and theoretically important model that has many practical applications. Recently, this setup gained a lot of interest in applications over wireless where communication constraints can be a performance…

Machine Learning · Computer Science 2022-06-10 Osama A. Hanna , Lin F. Yang , Christina Fragouli

This paper is concerned with online targeted advertising on social networks. The main technical task we address is to estimate the activation probability for user pairs, which quantifies the influence one user may have on another towards…

Social and Information Networks · Computer Science 2025-01-28 Tsuyoshi Idé , Keerthiram Murugesan , Djallel Bouneffouf , Naoki Abe

Clinical trials involving multiple treatments utilize randomization of the treatment assignments to enable the evaluation of treatment efficacies in an unbiased manner. Such evaluation is performed in post hoc studies that usually use…

Artificial Intelligence · Computer Science 2018-09-10 Yogatheesan Varatharajah , Brent Berry , Sanmi Koyejo , Ravishankar Iyer

Bandits with feedback graphs are powerful online learning models that interpolate between the full information and classic bandit problems, capturing many real-life applications. A recent work by Zhang et al. (2023) studies the contextual…

Machine Learning · Computer Science 2024-02-14 Mengxiao Zhang , Yuheng Zhang , Haipeng Luo , Paul Mineiro

Influence maximization is the task of finding a set of seed nodes in a social network such that the influence spread of these seed nodes based on certain influence diffusion model is maximized. Topic-aware influence diffusion models have…

Social and Information Networks · Computer Science 2014-11-24 Wei Chen , Tian Lin , Cheng Yang

Contextual multi-armed bandits (CMAB) have been widely used for learning to filter and prioritize information according to a user's interest. In this work, we analyze top-K ranking under the CMAB framework where the top-K arms are chosen…

Machine Learning · Computer Science 2022-01-31 Michael Rawson , Jade Freeman

Social Media Advertisement has emerged as an effective approach for promoting the brands of a commercial house. Hence, many of them have started using this medium to maximize the influence among the users and create a customer base. In…

Social and Information Networks · Computer Science 2025-04-02 Poonam Sharma , Dildar Ali , Suman Banerjee

We consider an application of multi-armed bandits to internet advertising (specifically, to dynamic ad allocation in the pay-per-click model, with uncertainty on the click probabilities). We focus on an important practical issue that…

Machine Learning · Computer Science 2013-06-04 Aleksandrs Slivkins

Contextual bandit algorithms provide principled online learning solutions to balance the exploitation-exploration trade-off in various applications such as recommender systems. However, the learning speed of the traditional contextual…

Machine Learning · Computer Science 2020-01-28 Xiaoying Zhang , Hong Xie , Hang Li , John C. S. Lui

We propose a contextual bandit based model to capture the learning and social welfare goals of a web platform in the presence of myopic users. By using payments to incentivize these agents to explore different items/recommendations, we show…

Machine Learning · Computer Science 2020-01-23 Priyank Agrawal , Theja Tulabandhula

With the growing importance of corporate viral marketing campaigns on online social networks, the interest in studies of influence propagation through networks is higher than ever. In a viral marketing campaign, a firm initially targets a…

Social and Information Networks · Computer Science 2013-10-10 Kumar Gaurav , Bartlomiej Blaszczyszyn , Holger Paul Keeler

We consider a novel variant of the contextual bandit problem (i.e., the multi-armed bandit with side-information, or context, available to a decision-maker) where the reward associated with each context-based decision may not always be…

Machine Learning · Computer Science 2020-07-21 Djallel Bouneffouf , Sohini Upadhyay , Yasaman Khazaeni

We study a novel variant of the multi-armed bandit problem, where at each time step, the player observes an independently sampled context that determines the arms' mean rewards. However, playing an arm blocks it (across all contexts) for a…

Machine Learning · Computer Science 2020-06-18 Soumya Basu , Orestis Papadigenopoulos , Constantine Caramanis , Sanjay Shakkottai