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