How to Cut A Cake Fairly

DOI10.2307/2311357zbMath0108.31601OpenAlexW4256264166MaRDI QIDQ3844704

Publication date: 1961

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2311357

zbMATH Keywords

probability theory

Related Items

On the Blackwell theorem in operator algebras, Functions Resembling Quotients of Measures, On guarantees, vetoes, and random dictators, Dual auctions for assigning winners and compensating losers, Fair division of goods in the shadow of market values, Keep your distance: land division with separation, Fair division of indivisible goods: recent progress and open questions, Fairly taking turns, Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem, On existence of truthful fair cake cutting mechanisms, Cutting cakes and kissing circles, Diverse fair allocations: complexity and algorithms, Fairness for multi-self agents, Contiguous Cake Cutting: Hardness Results and Approximation Algorithms, Disproportionate division, On a method of obtaining exact fair divisions, How to Cut a Cake Fairly: A Generalization to Groups, Efficient Approximations for the Online Dispersion Problem, Fairly allocating contiguous blocks of indivisible items, Fair Division, A generalization of Lyapunov’s convexity theorem with applications in optimal stopping, STOCHASTIC CAKE DIVISION PROTOCOL, Preference Relations and Measures in the Context of Fair Division, The Dubins-Spanier optimization problem in fair division theory, Unnamed Item, On the geometry of cake division, A general Hobby-Rice theorem and cake cutting, Fair Allocation of Indivisible Goods: Improvement, Unnamed Item, Closing Gaps in Asymptotic Fair Division, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Monotonicity and Solidarity Axioms in Economics and Game Theory, Fair Cake Division Under Monotone Likelihood Ratios, No-envy in the Queueing Problem with Multiple Identical Machines, 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, Cutting a cake for infinitely many guests, Truthful fair division without free disposal, The problem of fair division for a hybrid resource, Truthful Fair Division, Continuity of Choquet Integrals of Supermodular Capacities, How to cut a cake with a Gram matrix, Sets on which several measures agree, Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting, Cooperation in dividing the cake, How to cut a cake fairly using a minimal number of cuts, Envy-free division of multi-layered cakes, Approximating fair division with a limited number of cuts, Old and new moving-knife schemes, Dissolving a partnership dynamically, A note on cake cutting, Fair multi-cake cutting, Existence of a simple and equitable fair division: a short proof, Using \(\ell^p\)-norms for fairness in combinatorial optimisation, Dissolving a partnership securely, Fair allocation of indivisible goods: beyond additive valuations, Liapounov's convexity theorem for topological measures, On the computability of equitable divisions, Two birds with one stone: fairness and welfare via transfers, Asymptotic existence of fair divisions for groups, Population monotonic and strategy-proof mechanisms respecting welfare lower bounds, Fair cake-cutting in practice, Fair cake-cutting for imitative agents, KKM type theorems with boundary conditions, Rental harmony with roommates, Maximin share and minimax envy in fair-division problems., On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov Measures, The price of envy-freeness in machine scheduling, Proportional distribution schemes, Fair division under joint ownership: Recent results and open problems, A new class of convex games on \(\sigma\)-algebras and the optimal partitioning of measurable spaces, How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\), Dividing a cake fairly, A combinatorial algorithm to establish a fair border, An algorithm for super envy-free cake division, Potato Kugel, Partition ratios, Pareto optimal cake division and related notions, Envy-free two-player \(m\)-cake and three-player two-cake divisions, A characterization of \(\alpha \)-maximin solutions of fair division problems, Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities, Welfare bounds in the fair division problem, The price of fairness for indivisible goods, Allocating positions fairly: auctions and Shapley value, Resource-monotonicity and population-monotonicity in connected cake-cutting, Unanimous subjective probabilities, Dividing connected chores fairly, A problem in discrete distributive justice, Fair division of mixed divisible and indivisible goods, Extensions of cut-and-choose fair division, On totally balanced games arising from cooperation in fair division, Welfare bounds in the cooperative production problem, Strategic divide and choose, On the fair division of a heterogeneous commodity, Existence of the core in a heterogeneous divisible commodity exchange economy, How to divide the indivisible, Concave measures and the fuzzy core of exchange economies with heterogeneous divisible commodities, A theory of a heterogeneous divisible commodity exchange economy, On the possibilities for partitioning a cake, Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond, Finding maxmin allocations in cooperative and competitive fair division, A foundation of location theory: existence of equilibrium, the welfare theorems, and core, Optimal-Partitioning Inequalities for Nonatomic Probability Measures, Allocation rules for land division, Bounds for \(\alpha\)-optimal partitioning of a measurable space based on several efficient partitions, Optimal partitioning of an interval and applications to Sturm-Liouville eigenvalues, Fair cake-cutting among families, Vilfredo Pareto cuts the cake, Allocating contiguous blocks of indivisible chores fairly, Efficient egalitarian equivalent allocations over a single good, Envy-Free Division of Land, On a generalization of Lyapounov's theorem, Disputed lands, Optimal risk sharing with different reference probabilities, A ham sandwich theorem for general measures, On the structure of Pareto optimal cake partitions, Optimal partitioning of a measurable space into countably many sets, A Proportionality Principle for Partitioning Problems, Representation of preference relations on \(\sigma \)-algebras of nonatomic measure spaces: convexity and continuity, Monotonicity and competitive equilibrium in cake-cutting, Almost envy-free allocations with connected bundles, Optimal Partitioning of a Measurable Space, A sharp nonconvexity bound for partition ranges of vector measures with atoms, How to share a cake with a secret agent, Cake cutting: explicit examples for impossibility results, Mind the gap: cake cutting with separation, Equipartitioning common domains of non-atomic measures, A generalization of Lyapounov's theorem, Green eggs and ham, Obvious manipulations in cake-cutting, The theory of fuzzy decisions, cost distribution principle in social choice and optimal tax distribution, Fair division with uncertain needs and tastes, The problem of fair division for countably many participants, An equilibrium analysis of Knaster's fair division procedure, Fair division of a measurable space