4 papers
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…
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…
Public Event Scheduling with Busy Agents
Bo Li, Lijun Li, Minming Li +1
We study a public event scheduling problem, where multiple public events are scheduled to coordinate the availability of multiple agents. The availability of each agent is determin…
Online Dynamic Acknowledgement with Learned Predictions
Sungjin Im, Benjamin Moseley, Chenyang Xu +1
We revisit the online dynamic acknowledgment problem. In the problem, a sequence of requests arrive over time to be acknowledged, and all outstanding requests can be satisfied simu…