2 citations · 3 across the 7 of their papers we have counts for
6 papers · 1 filter
Multiagent Matroid Upgrading: Greedy is Fair and Efficient
Qingwen Ma, Chao Peng, Changfeng Xu +2
This paper introduces a general multiagent matroid upgrading problem that models a broad class of real-world resource allocation tasks. In this setting, there are multiple agents a…
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…
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…
Polylogarithmic Approximation for Robust s-t Path
Shi Li, Chenyang Xu, Ruilong Zhang
The paper revisits the robust - path problem, one of the most fundamental problems in robust optimization. In the problem, we are given a directed graph with vertices and…
Min-max Submodular Ranking for Multiple Agents
Qingyun Chen, Sungjin Im, Benjamin Moseley +2
In the submodular ranking (SR) problem, the input consists of a set of submodular functions defined on a ground set of elements. The goal is to order elements for all the functions…