2 papers
cs.GT2025
Online MMS Allocation for Chores
Jiaxin Song, Biaoshuai Tao, Wenqian Wang +1
We study the problem of fair division of indivisible chores among agents in an online setting, where items arrive sequentially and must be allocated irrevocably upon arrival. T…
cs.DS2024
Online Selfish Load Balancing
Wenqian Wang, Chenyang Xu, Yuhao Zhang
In selfish load balancing, there is a set of machines and jobs to be scheduled, where each machine is owned by a selfish agent. Agents hold the processing times of jobs as private…