A Note on a Cake Cutting Algorithm of Banach and Knaster
From MaRDI portal
Let \(\mu\) be a nonatomic probability measure on the Borel \(\sigma\)-algebra \({\mathcal B}^m\) in \(\mathbb{R}^m\), let \({\mathcal H}_k =\{a+A: a\in \mathbb{R}^m\), \(A\) is a \(k\)-dimensional subspace of \(\mathbb{R}^m\}\), \(1\leq k\leq m\), and let \({\mathcal H}^*_k =\{B\in {\mathcal H}_k: \mu (B)>0\) and \(\mu(C)=0\) whenever \(C\subset B\) and \(C\in {\mathcal H}_l\) with \(l<k\}\), \(1\leq k\leq m\). The main result states that \({\mathcal H}^*_k\) is a countable set for each \(k\).
Recommendations
- An approximation scheme for cake division with a linear number of cuts
- An approximation scheme for cake division with a linear number of cuts
- Contiguous cake cutting: hardness results and approximation algorithms
- A lower bound for cake cutting
- Cake cutting algorithms for piecewise constant and piecewise uniform valuations
- A remark on the slicing problem
- A remark on the slicing problem
- A protocol for cutting matroids like cakes
- Cake cutting algorithms
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
This page was built for publication: A Note on a Cake Cutting Algorithm of Banach and Knaster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339332)
