How to Cut a Cake Fairly
From MaRDI portal
Publication:3883835
DOI10.2307/2320951zbMath0441.90002OpenAlexW4231595518WikidataQ29040241 ScholiaQ29040241MaRDI QIDQ3883835
Publication date: 1980
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2320951
Related Items (77)
Fair and square: cake-cutting in two dimensions ⋮ Truthful fair division without free disposal ⋮ The problem of fair division for a hybrid resource ⋮ 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 ⋮ Divide-and-permute ⋮ Approximating fair division with a limited number of cuts ⋮ Old and new moving-knife schemes ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ A note on cake cutting ⋮ Fair multi-cake cutting ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Children crying at birthday parties. Why? ⋮ A pie allocation among sharing groups ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ On the computability of equitable divisions ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ Asymptotic existence of fair divisions for groups ⋮ Envy-free division via configuration spaces ⋮ On guarantees, vetoes, and random dictators ⋮ KKM type theorems with boundary conditions ⋮ Rental harmony with roommates ⋮ Keep your distance: land division with separation ⋮ Fair division of graphs and of tangled cakes ⋮ Cutting cakes and kissing circles ⋮ A sparse colorful polytopal KKM theorem ⋮ A moving-knife solution to the four-person envy-free cake-division problem ⋮ A combinatorial algorithm to establish a fair border ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ An algorithm for super envy-free cake division ⋮ When Do Envy-Free Allocations Exist? ⋮ Disproportionate division ⋮ On a method of obtaining exact fair divisions ⋮ Envy-free two-player \(m\)-cake and three-player two-cake divisions ⋮ A note on envy-free cake cutting with polynomial valuations ⋮ How to Cut a Cake Fairly: A Generalization to Groups ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Fairly allocating contiguous blocks of indivisible items ⋮ Expand the shares together: envy-free mechanisms with a small number of cuts ⋮ Fair Division ⋮ Dividing connected chores fairly ⋮ Fair division of mixed divisible and indivisible goods ⋮ On the complexity of cake cutting ⋮ Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts ⋮ Strategic divide and choose ⋮ On the fair division of a heterogeneous commodity ⋮ How to divide the indivisible ⋮ STOCHASTIC CAKE DIVISION PROTOCOL ⋮ The efficiency of fair division ⋮ Proportional pie-cutting ⋮ Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond ⋮ The Dubins-Spanier optimization problem in fair division theory ⋮ Unnamed Item ⋮ Envy-free cake division without assuming the players prefer nonempty pieces ⋮ Democratic fair allocation of indivisible goods ⋮ Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) ⋮ Fair cake-cutting among families ⋮ Allocating contiguous blocks of indivisible chores fairly ⋮ Efficient egalitarian equivalent allocations over a single good ⋮ Simple fair division of a square ⋮ Envy-Free Division of Land ⋮ Envy-free division of discrete cakes ⋮ Cutting a Cake for Five People ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Fairly Allocating Many Goods with Few Queries ⋮ Multilabeled Versions of Sperner's and Fan's Lemmas and Applications ⋮ Fair and efficient cake division with connected pieces ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Almost envy-free allocations with connected bundles ⋮ Splitting Necklaces, with Constraints ⋮ Fully Polynomial-Time Approximation Schemes for Fair Rent Division ⋮ Mind the gap: cake cutting with separation ⋮ Envy-free division in the presence of a dragon ⋮ Fair Cake Division Under Monotone Likelihood Ratios ⋮ A near equitable 2-person cake cutting algorithm
This page was built for publication: How to Cut a Cake Fairly
