Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Kumar, Yatharth"'
We study the problem of fairly assigning a set of discrete tasks (or chores) among a set of agents with additive valuations. Each chore is associated with a start and finish time, and each agent can perform at most one chore at any given time. The go
Externí odkaz:
http://arxiv.org/abs/2402.04353
