4 citations · 4 across the 5 of their papers we have counts for
5 papers
Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
Ankang Sun, Bo Chen
We study the problem of mechanism design for allocating a set of indivisible items among agents with private preferences on items. We are interested in such a mechanism that is str…
On Hill's Worst-Case Guarantee for Indivisible Bads
Bo Li, Hervé Moulin, Ankang Sun +1
When allocating objects among agents with equal rights, people often evaluate the fairness of an allocation rule by comparing their received utilities to a benchmark share - a func…
On the Price of Fairness of Allocating Contiguous Blocks
Ankang Sun, Bo Li
In this work, we revisit the problem of fairly allocating a number of indivisible items that are located on a line to multiple agents. A feasible allocation requires that the alloc…
Approximate Group Fairness for Clustering
Bo Li, Lijun Li, Ankang Sun +2
We incorporate group fairness into the algorithmic centroid clustering problem, where centers are to be located to serve agents distributed in a metric space. We refine the…
Fairness Criteria for Allocating Indivisible Chores: Connections and Efficiencies
Ankang Sun, Bo Chen, Xuan Vinh Doan
We study several fairness notions in allocating indivisible chores (i.e., items with non-positive values) to agents who have additive and submodular cost functions. The fairness cr…