activity
20222026
most citedAuction Design for Value Maximizers with Budget and Return-on-spend Constraints

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing 2025Show all

2 papers · 1 filter

cs.DS2025

Fair Submodular Maximization over a Knapsack Constraint

Lijun Li, Chenyang Xu, Liuyi Yang +1

We consider fairness in submodular maximization subject to a knapsack constraint, a fundamental problem with various applications in economics, machine learning, and data mining. I…

cs.DS2025

Logarithmic Approximations for Fair k-Set Selection

Shi Li, Chenyang Xu, Ruilong Zhang

We study the fair k-set selection problem where we aim to select sets from a given set system such that the (weighted) occurrence times that each element appears in these s…