English
Related papers

Related papers: Submodular Optimization Beyond Nonnegativity: Adap…

200 papers

Motivated by online retail, we consider the problem of selling one item (e.g., an ad slot) to two non-excludable buyers (say, a merchant and a brand). This problem captures, for example, situations where a merchant and a brand cooperatively…

Computer Science and Game Theory · Computer Science 2025-05-26 Gagan Aggarwal , Ashwinkumar Badanidiyuru , Paul Dütting , Federico Fusco

We study a problem of optimal information gathering from multiple data providers that need to be incentivized to provide accurate information. This problem arises in many real world applications that rely on crowdsourced data sets, but…

Computer Science and Game Theory · Computer Science 2017-11-27 Goran Radanovic , Adish Singla , Andreas Krause , Boi Faltings

Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…

Data Structures and Algorithms · Computer Science 2023-04-11 Shaojie Tang , Jing Yuan , Twumasi Mensah-Boateng

Social networks play a fundamental role in the diffusion of innovation through peers' influence on adoption. Thus, network position including a wide range of network centrality measures have been used to describe individuals' affinity to…

Social and Information Networks · Computer Science 2022-10-26 Balázs R. Sziklai , Balázs Lengyel

The problem of selecting an optimal seed set to maximise influence in networks has been a subject of intense research in recent years. However, despite numerous works addressing this area, it remains a topic that requires further…

Social and Information Networks · Computer Science 2025-04-16 Michał Czuba , Piotr Bródka

We study the problems of pricing an indivisible product to consumers who are embedded in a given social network. The goal is to maximize the revenue of the seller. We assume impatient consumers who buy the product as soon as the seller…

Computer Science and Game Theory · Computer Science 2015-02-10 Zhigang Cao , Xujin Chen , Xiaodong Hu , Changjun Wang

Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for…

Machine Learning · Statistics 2017-03-09 Rajiv Khanna , Ethan Elenberg , Alexandros G. Dimakis , Sahand Negahban , Joydeep Ghosh

Many phenomena in real world social networks are interpreted as spread of influence between activated and non-activated network elements. These phenomena are formulated by combinatorial graphs, where vertices represent the elements and…

Discrete Mathematics · Computer Science 2024-03-01 Siavash Askari , Manouchehr Zaker

Influence maximization (IM) aims to find seed users on an online social network to maximize the spread of information about a target product through word-of-mouth propagation among all users. Prior IM methods mostly focus on maximizing the…

Social and Information Networks · Computer Science 2024-02-27 Ying Wang , Yanhao Wang

The causal effect of showing an ad to a potential customer versus not, commonly referred to as "incrementality", is the fundamental question of advertising effectiveness. In digital advertising three major puzzle pieces are central to…

Machine Learning · Computer Science 2022-08-30 Randall Lewis , Jeffrey Wong

We study the problem of selecting a subset of vectors from a large set, to obtain the best signal representation over a family of functions. Although greedy methods have been widely used for tackling this problem and many of those have been…

Signal Processing · Electrical Eng. & Systems 2023-05-16 Ehsan Tohidi , Mario Coutino , David Gesbert

I study how a startup with uncertainty over product quality and no knowledge of the underlying diffusion network optimally chooses initial seeds. To ensure widespread adoption when the product is good while minimizing negative perceptions…

Theoretical Economics · Economics 2025-06-13 Eric Gao

We introduce the problem of maximizing approximately $k$-submodular functions subject to size constraints. In this problem, one seeks to select $k$-disjoint subsets of a ground set with bounded total size or individual sizes, and maximum…

Data Structures and Algorithms · Computer Science 2021-01-19 Leqian Zheng , Hau Chan , Grigorios Loukides , Minming Li

Social learning is a fundamental mechanism shaping decision-making across numerous social networks, including social trading platforms. In those platforms, investors combine traditional investing with copying the behavior of others.…

Physics and Society · Physics 2025-07-04 Bijin Joseph , Christoph Riedl , Alex Pentland , Esteban Moro

Purpose: We model group advertising decisions, which are the collective decisions of every single advertiser within the set of advertisers who are competing in the same auction or vertical industry, and examine resulting market outcomes,…

Artificial Intelligence · Computer Science 2022-03-07 Yanwu Yang , Xin Li , Bernard J. Jansen , Daniel Zeng

We study the task of selecting $k$ nodes, in a social network of size $n$, to seed a diffusion with maximum expected spread size, under the independent cascade model with cascade probability $p$. Most of the previous work on this problem…

Social and Information Networks · Computer Science 2022-05-24 Dean Eckles , Hossein Esfandiari , Elchanan Mossel , M. Amin Rahimian

Online recommendation and advertising are two major income channels for online recommendation platforms (e.g. e-commerce and news feed site). However, most platforms optimize recommending and advertising strategies by different teams…

Information Retrieval · Computer Science 2020-06-22 Xiangyu Zhao , Xudong Zheng , Xiwang Yang , Xiaobing Liu , Jiliang Tang

Many companies rely on advertising platforms such as Google, Facebook, or Instagram to recruit a large and diverse applicant pool for job openings. Prior works have shown that equitable bidding may not result in equitable outcomes due to…

Computers and Society · Computer Science 2023-05-24 Inbal Livni Navon , Charlotte Peale , Omer Reingold , Judy Hanwen Shen

We consider a class of distributed submodular maximization problems in which each agent must choose a single strategy from its strategy set. The global objective is to maximize a submodular function of the strategies chosen by each agent.…

Data Structures and Algorithms · Computer Science 2017-06-14 Bahman Gharesifard , Stephen L. Smith

We study fairness in social influence maximization, whereby one seeks to select seeds that spread a given information throughout a network, ensuring balanced outreach among different communities (e.g. demographic groups). In the literature,…

Social and Information Networks · Computer Science 2025-01-31 Shubham Chowdhary , Giulia De Pasquale , Nicolas Lanzetti , Ana-Andreea Stoica , Florian Dorfler