6 citations · 11 across the 11 of their papers we have counts for
12 papers
Fair and Efficient Allocations: Decision Problems in the Gap of Polynomial Hierarchy
Xiaolin Bu, Biaoshuai Tao
We consider the fair division problem with indivisible goods and study the following decision problem: given a fair division instance, does there exist an allocation that is envy-f…
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…
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…
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…
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,…
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…
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…
Fair Division with Allocator's Preference
Xiaolin Bu, Zihao Li, Shengxin Liu +2
We study the fair allocation of indivisible resources among agents. Most prior work focuses on fairness and/or efficiency among agents. However, the allocator, as the resource owne…
EFX Allocations Exist for Binary Valuations
Xiaolin Bu, Jiaxin Song, Ziqi Yu
We study the fair division problem and the existence of allocations satisfying the fairness criterion envy-freeness up to any item (EFX). The existence of EFX allocations is a majo…
Fair Division with Prioritized Agents
Xiaolin Bu, Zihao Li, Shengxin Liu +2
We consider the fair division problem of indivisible items. It is well-known that an envy-free allocation may not exist, and a relaxed version of envy-freeness, envy-freeness up to…
Approximability Landscape of Welfare Maximization within Fair Allocations
Xiaolin Bu, Zihao Li, Shengxin Liu +2
Fair allocation of indivisible goods studies allocating goods among agents in a fair manner. While fairness is a fundamental requirement in many real-world applications, it…
On Existence of Truthful Fair Cake Cutting Mechanisms
Xiaolin Bu, Jiaxin Song, Biaoshuai Tao
We study the fair division problem on divisible heterogeneous resources (the cake cutting problem) with strategic agents, where each agent can manipulate his/her private valuation…