How to Cut a Cake Fairly
From MaRDI portal
Cited in
(94)- Efficient egalitarian equivalent allocations over a single good
- On the fair division of a heterogeneous commodity
- How to cut a cake fairly using a minimal number of cuts
- A pie allocation among sharing groups
- Asymptotic existence of fair divisions for groups
- KKM type theorems with boundary conditions
- 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
- Approximating fair division with a limited number of cuts
- Old and new moving-knife schemes
- On the computability of equitable divisions
- An algorithm for super envy-free cake division
- Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting)
- Allocating contiguous blocks of indivisible chores fairly
- Almost envy-free allocations with connected bundles
- Mind the gap: cake cutting with separation
- Envy-free division in the presence of a dragon
- Envy-free division of multi-layered cakes
- Fair division of mixed divisible and indivisible goods
- Envy-free cake division without assuming the players prefer nonempty pieces
- Democratic fair allocation of indivisible goods
- Fair cake-cutting among families
- Simple fair division of a square
- Fair and square: cake-cutting in two dimensions
- The problem of fair division for a hybrid resource
- Divide-and-permute
- Existence of a simple and equitable fair division: a short proof
- Envy-free two-player \(m\)-cake and three-player two-cake divisions
- On the complexity of cake cutting
- Proportional pie-cutting
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Fair multi-cake cutting
- Fair allocation of indivisible goods: beyond additive valuations
- Two birds with one stone: fairness and welfare via transfers
- A near equitable 2-person cake cutting algorithm
- Envy-Free Division of Land
- Cutting a Cake for Five People
- Rental harmony with roommates
- A moving-knife solution to the four-person envy-free cake-division problem
- Efficient approximations for the online dispersion problem
- A note on envy-free cake cutting with polynomial valuations
- Closing gaps in asymptotic fair division
- Fairly allocating many goods with few queries
- Splitting necklaces, with constraints
- Dividing connected chores fairly
- Fair distributions for more participants than allocations
- Three persons, two cuts: a new cake-cutting algorithm
- Almost envy-free allocations with connected bundles
- Contiguous cake cutting: hardness results and approximation algorithms
- When do envy-free allocations exist?
- Disproportionate division
- On a method of obtaining an approximate solution of an exact fair division problem
- How to cut a cake fairly: a generalization to groups
- Fair Division
- How to divide the indivisible
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Stochastic cake division protocol
- Fair Cake Division Under Monotone Likelihood Ratios
- Fully polynomial-time approximation schemes for fair rent division
- Envy-free division of discrete cakes
- The Dubins-Spanier optimization problem in fair division theory
- A note on cake cutting
- Envy-free division via configuration spaces
- On guarantees, vetoes, and random dictators
- Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
- 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
- EFX allocations for indivisible chores: matching-based approach
- The frontier of intractability for EFX with two agents
- Elementary solution to the fair division problem
- A discrete and bounded locally envy-free cake cutting protocol on trees
- Approximate envy-freeness in graphical cake cutting
- Logarithmic algorithms for fair division problems
- Dividing a graphical cake
- Proportional allocations of multi-layered cakes
- Envy-free cake-cutting for four agents
- The efficiency of fair division
- The frontier of intractability for EFX with two agents
- Fractionally balanced hypergraphs and rainbow KKM theorems
- Computing approximate roots of monotone functions
- Connected equitable cake division via Sperner's lemma
- Fair distribution of bundles
- Logarithmic comparison-based query complexity for fair division of indivisible goods
- Fairer than fair: sharp bounds for connected super-proportional cake cutting
- The complexity of envy-free graph cutting
- Envy-free cake cutting: a polynomial number of queries with high probability
- Fair and efficient cake division with connected pieces
- Truthful fair division without free disposal
- Children crying at birthday parties. Why?
- A combinatorial algorithm to establish a fair border
- Strategic divide and choose
This page was built for publication: How to Cut a Cake Fairly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883835)
