An Envy-Free Cake Division Protocol
From MaRDI portal
Publication:4698451
DOI10.2307/2974850zbMATH Open0824.90142OpenAlexW4243871993WikidataQ55892270 ScholiaQ55892270MaRDI QIDQ4698451FDOQ4698451
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
Recommendations
Cited In (67)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Which is the fairest allocation in the max-min fairness-based coalitional game?
- Truthful fair division without free disposal
- Envy-free division of discrete cakes
- Two birds with one stone: fairness and welfare via transfers
- Envy-free cake divisions cannot be found by finite protocols
- Fairness and efficiency in cake-cutting with single-peaked preferences
- Title not available (Why is that?)
- Fair division of mixed divisible and indivisible goods
- A paradoxical Pareto frontier in the cake-cutting context
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction
- Fair allocation of indivisible goods: beyond additive valuations
- Cake cutting: explicit examples for impossibility results
- How to share a cake with a secret agent
- A moving-knife solution to the four-person envy-free cake-division problem
- STOCHASTIC CAKE DIVISION PROTOCOL
- Fair Division
- Expand the shares together: envy-free mechanisms with a small number of cuts
- On a method of obtaining exact fair divisions
- Preference Relations and Measures in the Context of Fair Division
- Disproportionate division
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
- How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\)
- Fairly Allocating Many Goods with Few Queries
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Existence of a simple and equitable fair division: a short proof
- An algorithm for super envy-free cake division
- The price of envy-freeness in machine scheduling
- A Protocol for Cutting Matroids Like Cakes
- A discrete and bounded envy-free cake cutting protocol for four agents
- A note on envy-free cake cutting with polynomial valuations
- Allocating contiguous blocks of indivisible chores fairly
- Envy-Free Division of Land
- Approximate envy-free procedures
- On Envy-Free Cake Division
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
- The efficiency of fair division
- Fair Cake Division Under Monotone Likelihood Ratios
- Old and new moving-knife schemes
- Bribe-proof rules in the division problem
- Title not available (Why is that?)
- On the possibilities for partitioning a cake
- Cutting a Cake for Five People
- On envy-free cake division
- Two-player envy-free multi-cake division
- On guarantees, vetoes, and random dictators
- Dividing connected chores fairly
- How to cut a cake fairly using a minimal number of cuts
- Meta-Envy-Free Cake-Cutting Protocols
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
- Computer science and decision theory
- The return function: a new computable perspective on Bayesian-Nash equilibria
- Maximin share and minimax envy in fair-division problems.
- Better ways to cut a cake
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Extensions of cut-and-choose fair division
- Dynamic Fair Resource Division
- Fairly taking turns
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
- On existence of truthful fair cake cutting mechanisms
- The Texas shoot-out under Knightian uncertainty
- Collective decision making
- Fair division with allocator's preference
- An iterative procedure for apportionment and its use in the 2016 Georgia Republican primary
- Maximize egalitarian welfare for cake cutting
- Three Persons, Two Cuts: A New Cake-Cutting Algorithm
This page was built for publication: An Envy-Free Cake Division Protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698451)
