Fair Division

DOI10.1007/978-1-0716-0368-0_198MaRDI QIDQ5150295zbMATH OpenOpenAlexFDO

Authors Steven J. Brams, Christian Klamler

Publication date 15 February 2021

Published in Complex Social and Behavioral Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-0716-0368-0_198

zbMATH Keywords

fair divisioncutting cakes

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Fair (and not so fair) division
• Truthful Fair Division
• Fair division of indivisible items
• Fair division with subsidy
• Fair division with multiple pieces
• Fair division of mixed divisible and indivisible goods
• The efficiency of fair division
• Fair Partitions

Cites work

• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• scientific article; zbMATH DE number 2153479 (Why is no real title available?)
• A discrete and bounded envy-free cake cutting protocol for four agents
• A moving-knife solution to the four-person envy-free cake-division problem
• A note on cake cutting
• A note on the undercut procedure
• A simple procedure for finding equitable allocations of indivisible goods
• An Envy-Free Cake Division Protocol
• Cake cutting really is not a piece of cake
• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
• Cutting a pie is not a piece of cake
• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
• Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division
• Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
• Envy-free cake divisions cannot be found by finite protocols
• Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
• Fair Allocation of Indivisible Goods
• Fair division of indivisible items
• Fair division of indivisible items between two players: design parameters for contested pile methods
• Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
• Fair enough: guaranteeing approximate maximin shares
• Handbook of Computational Social Choice
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly
• How to divide things fairly
• Introduction to the theory of fair allocation
• On the complexity of cake cutting
• Proportional pie-cutting
• Relations among certain ranges of vector measures
• Rental Harmony: Sperner's Lemma in Fair Division
• The undercut procedure: an algorithm for the envy-free division of indivisible items
• Two-person fair division of indivisible items: an efficient envy-free algorithm
• \(N\)-person cake-cutting: there may be no perfect division

Cited in

(16)

• Cake cutting algorithms
• What Is Just?
• The structure of fair-division problems and the design of fair-negotiation procedures
• Fair Share
• Asymptotic existence of proportionally fair allocations
• Communication complexity of discrete fair division
• How to divide things fairly
• Truthful Fair Division
• Weighted fair division of indivisible items: a review
• Games of fair division
• Disputed lands
• Fair division of indivisible items
• A general branch-and-bound algorithm for fair division problems
• Simple fair division of a square
• How to be fairer
• FAIR DIVISION UNDER INTERVAL UNCERTAINTY

This page was built for publication: Fair Division

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150295)