1 paper
Jiaxin Song, Biaoshuai Tao, Wenqian Wang +1
We study the problem of fair division of indivisible chores among n agents in an online setting, where items arrive sequentially and must be allocated irrevocably upon arrival. T…