scientific article; zbMATH DE number 2153479
From MaRDI portal
Publication:4666929
zbMath1071.91001MaRDI QIDQ4666929
Publication date: 7 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pareto optimalitymeasure spaceefficiency and fairness propertyfull individual pieces setindividual pieces setRadon-Nikodym set
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01)
Related Items (26)
Fair and square: cake-cutting in two dimensions ⋮ Cutting a cake for infinitely many guests ⋮ How to cut a cake with a Gram matrix ⋮ Fair distributions for more participants than allocations ⋮ A survey of mass partitions ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Children crying at birthday parties. Why? ⋮ Efficient Fair Division with Minimal Sharing ⋮ Fair cake-cutting for imitative agents ⋮ Fair division of goods in the shadow of market values ⋮ A characterization of \(\alpha \)-maximin solutions of fair division problems ⋮ Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities ⋮ Two-person cake cutting: the optimal number of cuts ⋮ Fair Division ⋮ Proportional pie-cutting ⋮ Finding maxmin allocations in cooperative and competitive fair division ⋮ On the existence of Pareto efficient and envy-free allocations ⋮ Bounds for \(\alpha\)-optimal partitioning of a measurable space based on several efficient partitions ⋮ Efficient egalitarian equivalent allocations over a single good ⋮ A brief history of social choice and welfare theory ⋮ Monotonicity and competitive equilibrium in cake-cutting ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ A paradoxical Pareto frontier in the cake-cutting context ⋮ Nash Social Welfare Approximation for Strategic Agents
This page was built for publication:
