activity
20232026
most citedEnvy-free House Allocation under Uncertain Preferences

1 citations · 1 across the 6 of their papers we have counts for

collaborators

10 papers

cs.GT2026

Settling PROPm and PROPavg in Graphical Resource Allocation

Bo Li, Ankang Sun, Ruijie Wang

We study proportional fairness in graphical resource allocation, where agents are vertices, indivisible items are edges, and each item must be allocated to one of its two endpoints…

cs.GT2026

Connected EF1 Allocations Exist in Discrete Chore Cutting

Ankang Sun, Bo Li

In this paper, we prove the existence of an envy-free up to one item (EF1) division for a discrete chore. Our approach builds on the powerful framework of Simmons-Su, which leverag…

cs.GT2026

Online Fair Division: Pushing the Frontier of Approximate Proportionality

Yingjian Du, Ankang Sun

Online fair division captures allocation problems in which indivisible resources arrive over time and must be assigned before future resources are known. Understanding what fairnes…

cs.GT2026

Fair Orientations: Proportionality and Equitability

Ankang Sun, Ruijie Wang, Bo Li

We study the fair allocation of indivisible items under relevance constraints, where each agent has a set of relevant items and can only receive items that are relevant to them. Wh…

cs.GT2026

Multi-Agent Non-Discriminatory Contracts

Ke Ding, Bo Li, Ankang Sun

We study multi-agent contracts, in which a principal delegates a task to multiple agents and incentivizes them to exert effort. Prior research has mostly focused on maximizing the…

cs.GT2025

Bin Packing and Covering: Pushing the Frontier on the Maximin Share Fairness

Bo Li, Ankang Sun, Zunyu Wang +1

We study a fundamental fair allocation problem, where the agent's value is determined by the number of bins either used to pack or cover the items allocated to them. Fairness is ev…

cs.GT2025

On the Subsidy of Envy-Free Orientations in Graphs

Bo Li, Ankang Sun, Mashbat Suzuki +1

We study a fair division problem in (multi)graphs where agents (vertices) are pairwise connected by items (edges), and each agent is only interested in its incident items. We c…

cs.GT2025

The (Exact) Price of Cardinality for Indivisible Goods: A Parametric Perspective

Alexander Lam, Bo Li, Ankang Sun

We adopt a parametric approach to analyze the worst-case degradation in social welfare when the allocation of indivisible goods is constrained to be fair. Specifically, we are conc…

cs.GT2024

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?

Bo Li, Ankang Sun, Shiji Xing

In this paper, we study the allocation of indivisible chores and consider the problem of finding a fair allocation that is approximately efficient. We shift our attention from the…

cs.GT2023★ 1 cited

Envy-free House Allocation under Uncertain Preferences

Haris Aziz, Isaiah Iliffe, Bo Li +3

We study the envy-free house allocation problem when agents have uncertain preferences over items and consider several well-studied preference uncertainty models. The central probl…