pith. sign in

arxiv: 2606.07238 · v1 · pith:67XOWUOEnew · submitted 2026-06-05 · 💻 cs.GT

No, Cake Cutting Really is a Piece of Cake

classification 💻 cs.GT
keywords cakecuttingachievesalgorithmanalyzecutsdesigndeterministic
0
0 comments X
read the original abstract

We design and analyze a deterministic cake cutting algorithm that achieves proportional fairness using a linear number of cuts.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.