The efficiency of fair division

DOI10.1007/S00224-011-9359-YMaRDI QIDQ692886zbMATH OpenOpenAlexFDO

Authors I. Caragiannis, C. Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou

Publication date 6 December 2012

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-011-9359-y

zbMATH Keywords

envy-freenessprice of fairnesscake-cuttingfair allocations

Mathematics Subject Classification ID

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

Recommendations

• The price of fairness for indivisible goods
• The price of fairness
• The price of fairness for a small number of indivisible items
• Price of fairness for allocating a bounded resource
• Efficient Fair Division with Minimal Sharing

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 1962847 (Why is no real title available?)
• A moving-knife solution to the four-person envy-free cake-division problem
• A note on cake cutting
• Algorithmic solutions for envy-free cake cutting
• An Envy-Free Cake Division Protocol
• An approximation algorithm for max-min fair allocation of indivisible goods
• Approximation algorithms for scheduling unrelated parallel machines
• Cake cutting really is not a piece of cake
• Cutting a Cake for Five People
• Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
• Envy-free cake divisions cannot be found by finite protocols
• Fair online load balancing
• Fairness Measures for Resource Allocation
• Fairness in routing and load balancing
• How to Cut a Cake Fairly
• MaxMin allocation via degree lower-bounded arborescences
• On allocating goods to maximize fairness
• On the complexity of cake cutting
• Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
• The Price of Stability for Network Design with Fair Cost Allocation
• The Santa Claus problem
• The fair allocation of an indivisible good when monetary compensations are possible

Cited in

(50)

• Truthful fair division without free disposal
• Price of fairness in two-agent single-machine scheduling problems
• Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
• Fair and square: cake-cutting in two dimensions
• How to obtain an equitable optimal fair division
• The price of fairness for indivisible goods
• Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach
• On existence of truthful fair cake cutting mechanisms
• Fairness and efficiency for allocations with participation constraints
• Fair Division
• Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
• A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism
• Efficient Fair Division with Minimal Sharing
• Truthful Fair Division
• Dividing connected chores fairly
• A fair division approach to humanitarian logistics inspired by conditional value-at-risk
• The price of fairness
• Fair division in the presence of externalities
• Penalties and rewards for fair learning in paired kidney exchange programs
• The price of anarchy of probabilistic serial in one-sided allocation problems
• Local fairness in hedonic games via individual threshold coalitions
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Implementing equal division with an ultimatum threat
• On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
• Optimal bounds on the price of fairness for indivisible goods
• Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
• The price of envy-freeness in machine scheduling
• Optimizing over serial dictatorships
• On the computability of equitable divisions
• Computing welfare-maximizing fair allocations of indivisible goods
• scientific article; zbMATH DE number 2153479 (Why is no real title available?)
• Allocating contiguous blocks of indivisible chores fairly
• The existence and efficiency of PMMS allocations
• On social envy-freeness in multi-unit markets
• Fair and efficient cake division with connected pieces
• Fair and efficient allocation with few agent types, few item types, or small value levels
• Dividing connected chores fairly
• The price of fairness for a small number of indivisible items
• Fair division of indivisible goods: recent progress and open questions
• Price of fairness for allocating a bounded resource
• On fairness via picking sequences in allocation of indivisible goods
• The price of fairness for a two-agent scheduling game minimizing total completion time
• A parametric worst-case approach to fairness in cooperative games with transferable utility
• EFX allocations exist for binary valuations
• Maximize egalitarian welfare for cake cutting
• Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
• Fair algorithm design: fair and efficacious machine scheduling
• Optimizing over serial dictatorships
• The price of equity with binary valuations and few agent types
• Envy-free relaxations for goods, chores, and mixed items

This page was built for publication: The efficiency of fair division

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