An Envy-Free Cake Division Protocol
From MaRDI portal
Recommendations
Cited in
(83)- Envy-free cake divisions cannot be found by finite protocols
- On finding an envy-free Pareto-optimal division
- On envy-free cake division
- How to cut a cake fairly using a minimal number of cuts
- Maximin share and minimax envy in fair-division problems.
- How to cut a cake with a Gram matrix
- Expand the shares together: envy-free mechanisms with a small number of cuts
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Old and new moving-knife schemes
- An algorithm for super envy-free cake division
- A three-player envy-free discrete division protocol for mixed manna
- Allocating contiguous blocks of indivisible chores fairly
- Fairness and efficiency in cake-cutting with single-peaked preferences
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Fair division of mixed divisible and indivisible goods
- Two-player envy-free multi-cake division
- Computer science and decision theory
- The return function: a new computable perspective on Bayesian-Nash equilibria
- How to share a cake with a secret agent
- Cake cutting: explicit examples for impossibility results
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Existence of a simple and equitable fair division: a short proof
- Bribe-proof rules in the division problem
- 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
- Fair allocation of indivisible goods: beyond additive valuations
- Two birds with one stone: fairness and welfare via transfers
- Approximate envy-free procedures
- On Envy-Free Cake Division
- A protocol for cutting matroids like cakes
- Envy-free divisions
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
- Envy-Free Division of Land
- Meta-Envy-Free Cake-Cutting Protocols
- Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction
- Cutting a Cake for Five People
- On the possibilities for partitioning a cake
- A moving-knife solution to the four-person envy-free cake-division problem
- How to obtain a range of a nonatomic vector measure in R^2
- scientific article; zbMATH DE number 2088164 (Why is no real title available?)
- A note on envy-free cake cutting with polynomial valuations
- Preference Relations and Measures in the Context of Fair Division
- scientific article; zbMATH DE number 1409181 (Why is no real title available?)
- Waste makes haste: bounded time algorithms for envy-free cake cutting with free disposal
- Fairly allocating many goods with few queries
- Dividing connected chores fairly
- Three persons, two cuts: a new cake-cutting algorithm
- Dynamic fair resource division
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Contiguous cake cutting: hardness results and approximation algorithms
- Disproportionate division
- On a method of obtaining an approximate solution of an exact fair division problem
- Fair Division
- A discrete and bounded envy-free cake cutting protocol for four agents
- Stochastic cake division protocol
- Better ways to cut a cake
- Fair Cake Division Under Monotone Likelihood Ratios
- Envy-free division of discrete cakes
- On guarantees, vetoes, and random dictators
- Fairly taking turns
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
- On existence of truthful fair cake cutting mechanisms
- An iterative procedure for apportionment and its use in the 2016 Georgia Republican primary
- Maximize egalitarian welfare for cake cutting
- The Texas shoot-out under Knightian uncertainty
- Collective decision making
- Fair division with allocator's preference
- Extensions of cut-and-choose fair division
- Fair division with prioritized agents
- Between proportionnality and envy-freeness: k-proportionality
- Proportional allocations of multi-layered cakes
- On the price of fairness of allocating contiguous blocks
- The efficiency of fair division
- The incentive guarantees behind Nash welfare in divisible resources allocation
- Almost envy-free allocation of indivisible goods: a tale of two valuations
- Logarithmic comparison-based query complexity for fair division of indivisible goods
- Unfairly splitting separable necklaces
- Envy-free cake cutting: a polynomial number of queries with high probability
- Simultaneously fair allocation of indivisible items across multiple dimensions
- Which is the fairest allocation in the max-min fairness-based coalitional game?
- Truthful fair division without free disposal
- The price of envy-freeness in machine scheduling
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)
