Constrained Stochastic Submodular Maximization with State-Dependent Costs

11/11/2021
by   Shaojie Tang, et al.
0

In this paper, we study the constrained stochastic submodular maximization problem with state-dependent costs. The input of our problem is a set of items whose states (i.e., the marginal contribution and the cost of an item) are drawn from a known probability distribution. The only way to know the realized state of an item is to select that item. We consider two constraints, i.e., inner and outer constraints. Recall that each item has a state-dependent cost, and the inner constraint states that the total realized cost of all selected items must not exceed a give budget. Thus, inner constraint is state-dependent. The outer constraint, one the other hand, is state-independent. It can be represented as a downward-closed family of sets of selected items regardless of their states. Our objective is to maximize the objective function subject to both inner and outer constraints. Under the assumption that larger cost indicates larger "utility", we present a constant approximate solution to this problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2019

Stochastic Submodular Probing with State-Dependent Costs

In this paper, we study a new stochastic submodular maximization problem...
research
05/23/2019

Price of Dependence: Stochastic Submodular Maximization with Dependent Items

In this paper, we study the stochastic submodular maximization problem w...
research
07/07/2018

Stochastic Coupon Probing in Social Networks

In this paper, we study stochastic coupon probing problem in social netw...
research
02/28/2021

Adaptive Regularized Submodular Maximization

In this paper, we study the problem of maximizing the difference between...
research
12/11/2020

Adaptive Submodular Meta-Learning

Meta-Learning has gained increasing attention in the machine learning an...
research
03/07/2018

Submodular maximization with uncertain knapsack capacity

We consider the maximization problem of monotone submodular functions un...
research
07/03/2019

Generalized Assignment via Submodular Optimization with Reserved Capacity

We study a variant of the generalized assignment problem ( GAP) with gro...

Please sign up or login with your details

Forgot password? Click here to reset