How to Cut A Cake Fairly

Cited in

(only showing first 100 items - show all)

Efficient egalitarian equivalent allocations over a single good
Disputed lands
Optimal risk sharing with different reference probabilities
Representation of preference relations on -algebras of nonatomic measure spaces: convexity and continuity
Fair division with uncertain needs and tastes
The problem of fair division for countably many participants
Fair division of a measurable space
A note on the cake-division problem
A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
Sets on which several measures agree
Proportional distribution schemes
Dividing a cake fairly
Potato Kugel
Welfare bounds in the fair division problem
A problem in discrete distributive justice
On totally balanced games arising from cooperation in fair division
Welfare bounds in the cooperative production problem
On the fair division of a heterogeneous commodity
A sharp nonconvexity bound for partition ranges of vector measures with atoms
A generalization of Lyapounov's theorem
The theory of fuzzy decisions, cost distribution principle in social choice and optimal tax distribution
How to cut a cake fairly using a minimal number of cuts
Maximin share and minimax envy in fair-division problems.
On the structure of Pareto optimal cake partitions
Green eggs and ham
How to cut a cake with a Gram matrix
Asymptotic existence of fair divisions for groups
KKM type theorems with boundary conditions
Resource-monotonicity and population-monotonicity in connected cake-cutting
Concave measures and the fuzzy core of exchange economies with heterogeneous divisible commodities
Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
A foundation of location theory: existence of equilibrium, the welfare theorems, and core
Allocation rules for land division
Vilfredo Pareto cuts the cake
On a generalization of Lyapounov's theorem
Optimal partitioning of a measurable space into countably many sets
Approximating fair division with a limited number of cuts
Old and new moving-knife schemes
Liapounov's convexity theorem for topological measures
On the computability of equitable divisions
An algorithm for super envy-free cake division
Partition ratios, Pareto optimal cake division and related notions
Allocating contiguous blocks of indivisible chores fairly
Almost envy-free allocations with connected bundles
Mind the gap: cake cutting with separation
Obvious manipulations in cake-cutting
Cutting a cake for infinitely many guests
Envy-free division of multi-layered cakes
Dissolving a partnership securely
The price of fairness for indivisible goods
Allocating positions fairly: auctions and Shapley value
Fair division of mixed divisible and indivisible goods
Finding maxmin allocations in cooperative and competitive fair division
Optimal partitioning of an interval and applications to Sturm-Liouville eigenvalues
Fair cake-cutting among families
Monotonicity and competitive equilibrium in cake-cutting
How to share a cake with a secret agent
Cake cutting: explicit examples for impossibility results
An equilibrium analysis of Knaster's fair division procedure
The problem of fair division for a hybrid resource
Existence of a simple and equitable fair division: a short proof
Envy-free two-player \(m\)-cake and three-player two-cake divisions
Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities
Unanimous subjective probabilities
Bounds for \(\alpha\)-optimal partitioning of a measurable space based on several efficient partitions
Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
Fair multi-cake cutting
Using \(\ell^p\)-norms for fairness in combinatorial optimisation
Fair allocation of indivisible goods: beyond additive valuations
Two birds with one stone: fairness and welfare via transfers
Fair cake-cutting in practice
Fair cake-cutting for imitative agents
Truthful Fair Division
Continuity of Choquet integrals of supermodular capacities
Dissolving a partnership dynamically
Envy-Free Division of Land
Optimal-Partitioning Inequalities for Nonatomic Probability Measures
On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov Measures
A Proportionality Principle for Partitioning Problems
Optimal Partitioning of a Measurable Space
On the possibilities for partitioning a cake
Population monotonic and strategy-proof mechanisms respecting welfare lower bounds
Rental harmony with roommates
A generalization of Lyapunov’s convexity theorem with applications in optimal stopping
How to obtain a range of a nonatomic vector measure in R^2
Efficient approximations for the online dispersion problem
Preference Relations and Measures in the Context of Fair Division
Fair allocation of indivisible goods: improvement
Closing gaps in asymptotic fair division
Dividing connected chores fairly
No-envy in the queueing problem with multiple identical machines
Almost envy-free allocations with connected bundles
Contiguous cake cutting: hardness results and approximation algorithms
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
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
A theory of a heterogeneous divisible commodity exchange economy

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 Q3844704)