English
Related papers

Related papers: Submodular Optimization Beyond Nonnegativity: Adap…

200 papers

Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize value of information? These applications exhibit strong diminishing returns: Selection of…

Machine Learning · Computer Science 2009-08-07 Daniel Golovin , Andreas Krause , Matthew Streeter

In a "tipping" model, each node in a social network, representing an individual, adopts a property or behavior if a certain number of his incoming neighbors currently exhibit the same. In viral marketing, a key problem is to select an…

Social and Information Networks · Computer Science 2013-09-13 Paulo Shakarian , Sean Eyre , Damon Paulo

This paper develops a theoretical model to study the economic incentives for a social media platform to moderate user-generated content. We show that a self-interested platform can use content moderation as an effective marketing tool to…

General Economics · Economics 2023-04-20 Yi Liu , Pinar Yildirim , Z. John Zhang

Embedding diversity into knowledge discovery tasks is of crucial importance to enhance the meaningfulness of the mined patterns with high-impact aspects related to novelty, serendipity, and ethics. Surprisingly, in the classic problem of…

Social and Information Networks · Computer Science 2019-12-10 Antonio Caliò , Andrea Tagarelli

A fundamental task underlying many important optimization problems, from influence maximization to sensor placement to content recommendation, is to select the optimal group of $k$ items from a larger set. Submodularity has been very…

Data Structures and Algorithms · Computer Science 2022-03-02 Jon Kleinberg , Emily Ryu , Éva Tardos

In this paper, we study the Multi-Round Influence Maximization (MRIM) problem, where influence propagates in multiple rounds independently from possibly different seed sets, and the goal is to select seeds for each round to maximize the…

Social and Information Networks · Computer Science 2019-06-07 Lichao Sun , Weiran Huang , Philip S. Yu , Wei Chen

Now-a-days, \emph{Online Social Networks} have been predominantly used by commercial houses for viral marketing where the goal is to maximize profit. In this paper, we study the problem of Profit Maximization in the two\mbox{-}phase…

Databases · Computer Science 2022-07-19 Poonam Sharma , Suman Banerjee

Billboard Advertisement has emerged as an effective out-of-home advertisement technique and adopted by many commercial houses. In this case, the billboards are owned by some companies and they are provided to the commercial houses…

Databases · Computer Science 2022-07-15 Dildar Ali , Suman Banerjee , Yamuna Prasad

The research of influence propagation in social networks via word-of-mouth processes has been given considerable attention in recent years. Arguably, the most fundamental problem in this domain is influence maximization, where the goal is…

Data Structures and Algorithms · Computer Science 2018-03-13 Noa Avigdor-Elgrabli , Gideon Blocq , Iftah Gamzu , Ariel Orda

Motivated by applications in online advertising, we consider a class of maximization problems where the objective is a function of the sequence of actions as well as the running duration of each action. For these problems, we introduce the…

Discrete Mathematics · Computer Science 2019-03-15 Saeed Alaei , Ali Makhdoumi , Azarakhsh Malekian

Diffusion of information, innovation, and ideas is an important phenomenon in social networks. Information propagates through the network and reaches from one person to the next. In many settings, it is meaningful to restrict diffusion so…

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

Online social network has been one of the most important platforms for viral marketing. Most of existing researches about diffusion of adoptions of new products on networks are about one diffusion. That is, only one piece of information…

Social and Information Networks · Computer Science 2023-05-17 Tiantian Chen , Jianxiong Guo , Weili Wu

Finding a small subset of influential nodes to maximise influence spread in a complex network is an active area of research. Different methods have been proposed in the past to identify a set of seed nodes that can help achieve a faster…

Social and Information Networks · Computer Science 2022-12-23 Abida Sadaf , Luke Mathieson , Piotr Bródka , Katarzyna Musial

Community partition is an important problem in many areas such as biology network, social network. The objective of this problem is to analyse the relationships among data via the network topology. In this paper, we consider the community…

Social and Information Networks · Computer Science 2020-07-07 Qiufen Ni , Jianxiong Guo , Chuanhe Huang , Weili Wu

Influence maximization (IM) has garnered a lot of attention in the literature owing to applications such as viral marketing and infection containment. It aims to select a small number of seed users to adopt an item such that adoption…

Social and Information Networks · Computer Science 2020-12-08 Prithu Banerjee , Wei Chen , Laks V. S. Lakshmanan

Given a budget and arbitrary cost for selecting each node, the budgeted influence maximization (BIM) problem concerns selecting a set of seed nodes to disseminate some information that maximizes the total number of nodes influenced (termed…

Social and Information Networks · Computer Science 2013-01-23 Huy Nguyen , Rong Zheng

Given a social network of users with selection cost, the \textsc{Budgeted Influence Maximization Problem} (\emph{BIM Problem} in short) asks for selecting a subset of the nodes (known as \emph{seed nodes}) within an allocated budget for…

Social and Information Networks · Computer Science 2021-04-15 Suman Banerjee

Online influence maximization aims to maximize the influence spread of a content in a social network with unknown network model by selecting a few seed nodes. Recent studies followed a non-adaptive setting, where the seed nodes are selected…

Machine Learning · Computer Science 2022-07-01 Kaixuan Huang , Yu Wu , Xuezhou Zhang , Shenyinying Tu , Qingyun Wu , Mengdi Wang , Huazheng Wang

In a social network, even about the same information the excitements between different pairs of users are different. If you want to spread a piece of new information and maximize the expected total amount of excitements, which seed users…

Social and Information Networks · Computer Science 2016-10-26 Zhefeng Wang , Yu Yang , Jian Pei , Enhong Chen

In the classical selection problem, the input consists of a collection of elements and the goal is to pick a subset of elements from the collection such that some objective function $f$ is maximized. This problem has been studied…

Data Structures and Algorithms · Computer Science 2021-09-06 Sofia Maria Nikolakaki , Alina Ene , Evimaria Terzi