3 papers
cs.GT2025
Incentive Analysis of Collusion in Fair Division
Haoqiang Huang, Biaoshuai Tao, Mingwei Yang +1
We study fair division problems with strategic agents capable of gaining advantages by manipulating their reported preferences. Although several impossibility results have revealed…
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.DS2024
Online Metric Matching: Beyond the Worst Case
Mingwei Yang, Sophie H. Yu
We study the online metric matching problem. There are servers and requests located in a metric space, where all servers are available upfront and requests arrive one at a…