Dividing a cake fairly
From MaRDI portal
Publication:1160300
DOI10.1016/0022-247X(80)90225-5zbMath0476.28001OpenAlexW2004738599WikidataQ59663878 ScholiaQ59663878MaRDI QIDQ1160300
Publication date: 1980
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(80)90225-5
Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05)
Related Items (38)
A note on the cake-division problem ⋮ Cutting a Cake Fairly for Groups Revisited ⋮ Fair and square: cake-cutting in two dimensions ⋮ Sets on which several measures agree ⋮ Fair distributions for more participants than allocations ⋮ Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ How to cut a cake fairly using a minimal number of cuts ⋮ Envy-free division of multi-layered cakes ⋮ Approximating fair division with a limited number of cuts ⋮ Fair multi-cake cutting ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Liapounov's convexity theorem for topological measures ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ Envy-free division via configuration spaces ⋮ On guarantees, vetoes, and random dictators ⋮ On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov Measures ⋮ Fair division of graphs and of tangled cakes ⋮ Cutting cakes and kissing circles ⋮ A sparse colorful polytopal KKM theorem ⋮ How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) ⋮ A combinatorial algorithm to establish a fair border ⋮ An algorithm for super envy-free cake division ⋮ Equitable allocation of divisible goods ⋮ How to Cut a Cake Fairly: A Generalization to Groups ⋮ On the complexity of cake cutting ⋮ Ramsey partitions of integers and fair divisions ⋮ On the fair division of a heterogeneous commodity ⋮ Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond ⋮ The Dubins-Spanier optimization problem in fair division theory ⋮ Envy-free cake division without assuming the players prefer nonempty pieces ⋮ Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) ⋮ Simple fair division of a square ⋮ Envy-free division of discrete cakes ⋮ Multilabeled Versions of Sperner's and Fan's Lemmas and Applications ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Splitting Necklaces, with Constraints ⋮ How to share a cake with a secret agent ⋮ Envy-free division in the presence of a dragon
Cites Work
This page was built for publication: Dividing a cake fairly
