93 citations · 149 across the 17 of their papers we have counts for
14 papers · 1 filter
On the Incompatibility of Weighted PROPX and Pareto Optimality for Indivisible Chores
Haris Aziz, Bo Li
Proportionality (PROP) is one of the simplest fairness criteria for allocating items among agents with additive preferences. With indivisible chores, however, PROP is not always sa…
Proportional Fairness in Obnoxious Facility Location
Alexander Lam, Haris Aziz, Bo Li +2
We consider the obnoxious facility location problem (in which agents prefer the facility location to be far from them) and propose a hierarchy of distance-based proportional fairne…
Fair Division of Indivisible Goods: Recent Progress and Open Questions
Georgios Amanatidis, Haris Aziz, Georgios Birmpas +5
Allocating resources to individuals in a fair manner has been a topic of interest since ancient times, with most of the early mathematical work on the problem focusing on resources…
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…
Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions
Haris Aziz, Bo Li, Herve Moulin +1
The theory of algorithmic fair allocation is within the center of multi-agent systems and economics in the last decade due to its industrial and social importance. At a high level,…
Eliciting Truthful Reports with Partial Signals in Repeated Games
Yutong Wu, Ali Khodabakhsh, Bo Li +2
We consider a repeated game where a player self-reports her usage of a service and is charged a payment accordingly by a center. The center observes a partial signal, representing…
Approximately Envy-Free Budget-Feasible Allocation
Jiarui Gan, Bo Li, Xiaowei Wu
In the budget-feasible allocation problem, a set of items with varied sizes and values are to be allocated to a group of agents. Each agent has a budget constraint on the total siz…
Mechanism Design for Facility Location Problems: A Survey
Hau Chan, Aris Filos-Ratsikas, Bo Li +2
The study of approximate mechanism design for facility location problems has been in the center of research at the intersection of artificial intelligence and economics for the las…
Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences
Haris Aziz, Bo Li, Xiaowei Wu
We initiate the work on maximin share (MMS) fair allocation of m indivisible chores to n agents using only their ordinal preferences, from both algorithmic and mechanism design per…
Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free
Xiaowei Wu, Bo Li, Jiarui Gan
The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivis…
Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives
Haris Aziz, Hau Chan, Barton E. Lee +2
We consider the facility location problem in the one-dimensional setting where each facility can serve a limited number of agents from the algorithmic and mechanism design perspect…
Weighted Maxmin Fair Share Allocation of Indivisible Chores
Haris Aziz, Hau Chan, Bo Li
We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WM…
Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
Haris Aziz, Bo Li, Xiaowei Wu
We initiate the work on fair and strategyproof allocation of indivisible chores. The fairness concept we consider in this paper is maxmin share (MMS) fairness. We consider three pr…