3 papers
cs.DS2026
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…
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…