3 papers
cs.GT2026
Approximate Maximin Share with Subjective Divisibility: Beating the 1/2 Barrier
Xiaohui Bei, Ke Ding, Bo Li +1
Maximin share (MMS) stands out as a central notion in fair resource allocation. It is known that exact MMS fairness is not always attainable, especially when agents differ along tw…
cs.GT2025
When is Truthfully Allocating Chores no Harder than Goods?
Bo Li, Biaoshuai Tao, Fangxiao Wang +3
We study the problem of fairly and efficiently allocating a set of items among strategic agents with additive valuations, where items are either all indivisible or all divisible. W…
cs.GT2024
A Complete Landscape of EFX Allocations on Graphs: Goods, Chores and Mixed Manna
Bo Li, Minming Li, Tianze Wei +2
We study envy-free up to any item (EFX) allocations on simple graphs where vertices and edges represent agents and items respectively. An agent (vertex) is only interested in items…