TL;DR
This paper introduces an online version of the cake cutting problem, adapting existing fair division procedures to dynamic scenarios where players arrive and leave, and analyzes their fairness properties.
Contribution
It extends classical cake cutting methods to online settings and evaluates their fairness properties in dynamic resource division.
Findings
Online cake cutting procedures can be adapted from classical methods.
Some online procedures satisfy proportionality and envy-freeness.
The paper identifies which fairness properties are achievable online.
Abstract
We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the Dubins-Spanier moving knife procedure can be adapted to apply to such online problems. We propose some desirable properties that online cake cutting procedures might possess like online forms of proportionality and envy-freeness, and identify which properties are in fact possessed by the different online cake procedures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Auction Theory and Applications · Complexity and Algorithms in Graphs