Benwei Wu
YOU?
Author Swipe
View article: On the task assignment with group fairness for spatial crowdsourcing
On the task assignment with group fairness for spatial crowdsourcing Open
Task assignment, the core problem of Spatial Crowdsourcing (SC), is often modeled as an optimization problem with multiple constraints, and the quality and efficiency of its solution determines how well the SC system works. Fairness is a c…
View article: Efficient and Effective Algorithms for Revenue Maximization in Social Advertising
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising Open
We consider the revenue maximization problem in social advertising, where a social network platform owner needs to select seed users for a group of advertisers, each with a payment budget, such that the total expected revenue that the owne…
View article: Efficient and Effective Algorithms for Revenue Maximization in Social Advertising Efficient and Effective Algorithms for Revenue Maximization in Social Advertising
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising Efficient and Effective Algorithms for Revenue Maximization in Social Advertising Open
We consider the revenue maximization problem in social advertising, where a
social network platform owner needs to select seed users for a group of
advertisers, each with a payment budget, such that the total expected revenue
that the owne…
View article: The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization
The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization Open
Submodular optimization has numerous applications such as crowdsourcing and viral marketing. In this paper, we study the fundamental problem of non-negative submodular function maximization subject to a $k$-system constraint, which general…
View article: Efficient and Effective Algorithms for Revenue Maximization in Social Advertising
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising Open
We consider the revenue maximization problem in social advertising, where a social network platform owner needs to select seed users for a group of advertisers, each with a payment budget, such that the total expected revenue that the owne…
View article: Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time Open
We study the problem of maximizing a non-monotone, non-negative submodular function subject to a matroid constraint. The prior best-known deterministic approximation ratio for this problem is $\frac{1}{4}-ε$ under $\mathcal{O}(({n^4}/ε)\lo…