An Envy-Free Cake Division Protocol
From MaRDI portal
Publication:4698451
DOI10.2307/2974850zbMath0824.90142OpenAlexW4243871993WikidataQ55892270 ScholiaQ55892270MaRDI QIDQ4698451
Alan D. Taylor, Steven J. Brams
Publication date: 4 May 1995
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2974850
Related Items (51)
Which is the fairest allocation in the max-min fairness-based coalitional game? ⋮ Truthful fair division without free disposal ⋮ Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ On envy-free cake division ⋮ How to cut a cake fairly using a minimal number of cuts ⋮ Old and new moving-knife schemes ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Dynamic Fair Resource Division ⋮ A Protocol for Cutting Matroids Like Cakes ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ Fairness and efficiency in cake-cutting with single-peaked preferences ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ On guarantees, vetoes, and random dictators ⋮ Maximin share and minimax envy in fair-division problems. ⋮ The price of envy-freeness in machine scheduling ⋮ Fairly taking turns ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ On existence of truthful fair cake cutting mechanisms ⋮ A moving-knife solution to the four-person envy-free cake-division problem ⋮ How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ An algorithm for super envy-free cake division ⋮ Disproportionate division ⋮ On a method of obtaining exact fair divisions ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ A note on envy-free cake cutting with polynomial valuations ⋮ 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 ⋮ Extensions of cut-and-choose fair division ⋮ STOCHASTIC CAKE DIVISION PROTOCOL ⋮ The efficiency of fair division ⋮ Preference Relations and Measures in the Context of Fair Division ⋮ On the possibilities for partitioning a cake ⋮ Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond ⋮ Two-player envy-free multi-cake division ⋮ Computer science and decision theory ⋮ Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction ⋮ Allocating contiguous blocks of indivisible chores fairly ⋮ Envy-Free Division of Land ⋮ Cutting a Cake for Five People ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ⋮ The return function: a new computable perspective on Bayesian-Nash equilibria ⋮ Fairly Allocating Many Goods with Few Queries ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ A paradoxical Pareto frontier in the cake-cutting context ⋮ Worst case compromises in matroids with applications to the allocation of indivisible goods ⋮ Fair Cake Division Under Monotone Likelihood Ratios
This page was built for publication: An Envy-Free Cake Division Protocol
