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

The paper introduces a new online fair division framework where a learner must allocate indivisible items to agents in real time, balancing fairness and efficiency. Traditional methods rely on many copies of each item to estimate utilities, but this is unrealistic for platforms with many users and few interactions. By treating utility as an unknown function of item-agent features and framing the problem as a contextual bandit, the authors propose algorithms that achieve sublinear regret and demonstrate their effectiveness experimentally.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

• agents
• reinforcement-learning
• safety