activity
20222026
collaborators
Showing cs.GTShow all

8 papers · 1 filter

cs.GT2026

Bayesian Fair Division: Truthfulness in Picking Sequence with Correlated Valuations

Xiaolin Bu, Biaoshuai Tao

Sequential allocation mechanisms contain a class of widely studied mechanisms (e.g., round-robin) in the fair division of indivisible goods, where agents take turns picking items i…

cs.GT2026

Auctions with Contract Design

Xiaolin Bu, Jiarong Jin, Junzhu Ke +6

We consider a new auction model where the bidders' utilities and the auctioneer's revenue depend on a quality factor of the transaction determined by costly and strategic investmen…

cs.GT2026

Best-of-Both-Worlds Fairness for Mixed Goods and Chores

Haris Aziz, Xiaolin Bu, Xinhang Lu +4

We study the fundamental problem of fairly dividing indivisible items among agents with additive utilities. In our model, an item can be a good yielding non-negative utilities to s…

cs.GT2024

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods

Xiaolin Bu, Zihao Li, Shengxin Liu +2

We study the problem of fairly allocating either a set of indivisible goods or a set of mixed divisible and indivisible goods (i.e., mixed goods) to agents with additive utilities,…

cs.GT2024

Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness

Xiaolin Bu, Biaoshuai Tao

We study the problem of fairly and truthfully allocating indivisible items to agents with additive preferences. Specifically, we consider truthful mechanisms outputting all…

cs.GT2024

Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods

Xiaolin Bu, Zihao Li, Shengxin Liu +2

We study the problem of fairly allocating indivisible goods to agents, where agents may have different preferences over the goods. In the traditional setting, agents' valua…