Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
This paper proposes algorithms that model online fair division as a contextual bandit problem and achieve provable sublinear regret and proposes algorithms that model utility is an unknown function of item-agent features.
A. Verma, Indrajit Saha, Makoto Yokoo et al.
· 4 citations