An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916033517846528 |
|---|---|
| author | Arndt, Stephen Pruhs, Kirk Tran, Trung |
| author_facet | Arndt, Stephen Pruhs, Kirk Tran, Trung |
| contents | We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use $Ω(n \log n)$ queries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_21829 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces Arndt, Stephen Pruhs, Kirk Tran, Trung Data Structures and Algorithms Discrete Mathematics We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use $Ω(n \log n)$ queries. |
| title | An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces |
| topic | Data Structures and Algorithms Discrete Mathematics |
| url | https://arxiv.org/abs/2605.21829 |