works on

From the 1 of 18 linked papers with an AI index.

collaborators

18 papers

cs.GT2026

Non-Existence of EFX Chore Allocations for Monotone Cost Functions with Binary Marginals

Zehan Lin, Shengxin Liu, Biaoshuai Tao +1

We study the existence of envy-free up to any item (EFX) allocations of indivisible chores when agents have monotone cost functions with binary marginals. For indivisible goods, th…

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

Limitations of Best-of-Both-Worlds Solutions in Approval-Based Multiwinner Elections

Jiarong Jin, Xuanxuan Liu, Biaoshuai Tao

We study the best-of-both-worlds fairness in approval-based multi-winner elections, asking whether ex-ante guarantees for a fractional outcome can be implemented while every realiz…

cs.GT2026

Auctions with Contract Design

Xiaolin Bu, Jiarong Jin, Junzhu Ke +6

The paper proposes an auction model where bidders make costly quality investments and the auctioneer uses contract-based transfer rules to reward realized quality, analyzing optima…

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.GT2026

EFX for Additive Chores: Nonexistence, Pareto Incompatibility, and Bi-Valued Existence

Wentao He, Biaoshuai Tao

We consider the fair division problem of indivisible chores and resolve the long-standing open problem for the existence of EFX (envy-free up to any item) allocations with additive…