Online cake cutting

DOI10.1007/978-3-642-24873-3_22MaRDI QIDQ3095310zbMATH OpenOpenAlexWikidataFDO

Authors Toby Walsh

Publication date 28 October 2011

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.0614

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Rationality and learning in game theory (91A26)

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.

Recommendations

• scientific article; zbMATH DE number 3849005
• Fair multi-cake cutting
• Old and new moving-knife schemes
• Extensions of cut-and-choose fair division
• scientific article; zbMATH DE number 1962847

Cited in

(8)

• Resource-monotonicity and population-monotonicity in connected cake-cutting
• Monotonicity and competitive equilibrium in cake-cutting
• Fair cake-cutting in practice
• Most competitive mechanisms in online fair division
• Dynamic fair resource division
• Monotone and Online Fair Division
• Class fairness in online matching
• The long arm of Nashian allocation in online p-mean welfare maximization

This page was built for publication: Online cake cutting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095310)