Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
Cutting Down the Tower: Single-Exponential Envy-Free Cake Cutting
Qilin Ye, Yannan Bai
Envy-free cake cutting is a central problem in fair division with a striking divide between existence and computation. Classical topology guarantees that envy-free allocations exis…
cs.GT2025
Fair Multi-agent Persuasion with Submodular Constraints
Yannan Bai, Kamesh Munagala, Yiheng Shen +1
We study the problem of selection in the context of Bayesian persuasion. We are given multiple agents with hidden values (or quality scores), to whom resources must be allocated by…
cs.GT2024
Fair Division via the Cake-Cutting Share
Yannan Bai, Kamesh Munagala, Yiheng Shen +1
In this paper, we consider the classic fair division problem of allocating divisible items to agents with linear valuations over the items. We define novel notions of fair…