Search Results for author:
Found 1 papers, 0 papers with code
Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits
The classic cake-cutting problem provides a model for addressing the fair and efficient allocation of a divisible, heterogeneous resource among agents with distinct preferences.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
