Indrajit Saha

Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies

This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that has to be irrevocably allocated to one of the agents while satisfying a desired balance between fairness and efficiency. Existing algor…