The efficiency of fair division
From MaRDI portal
Publication:692886
DOI10.1007/s00224-011-9359-yzbMath1262.91099OpenAlexW2156671446MaRDI QIDQ692886
Panagiotis Kanellopoulos, Maria Kyropoulou, Ioannis Caragiannis, Christos Kaklamanis
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
Related Items (30)
Fair and square: cake-cutting in two dimensions ⋮ Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach ⋮ Truthful fair division without free disposal ⋮ Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ A fair division approach to humanitarian logistics inspired by conditional value-at-risk ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ The price of envy-freeness in machine scheduling ⋮ Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship ⋮ Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach ⋮ On existence of truthful fair cake cutting mechanisms ⋮ The existence and efficiency of PMMS allocations ⋮ On fairness via picking sequences in allocation of indivisible goods ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Price of fairness in two-agent single-machine scheduling problems ⋮ Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods ⋮ A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism ⋮ Fairly allocating contiguous blocks of indivisible items ⋮ The price of fairness for indivisible goods ⋮ Dividing connected chores fairly ⋮ Price of fairness for allocating a bounded resource ⋮ Polyhedral Clinching Auctions and the AdWords Polytope ⋮ Local fairness in hedonic games via individual threshold coalitions ⋮ The Price of Fairness for a Small Number of Indivisible Items ⋮ Allocating contiguous blocks of indivisible chores fairly ⋮ On social envy-freeness in multi-unit markets ⋮ Fair and efficient cake division with connected pieces ⋮ The price of fairness for a two-agent scheduling game minimizing total completion time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair online load balancing
- A note on cake cutting
- Approximation algorithms for scheduling unrelated parallel machines
- Envy-free cake divisions cannot be found by finite protocols
- The fair allocation of an indivisible good when monetary compensations are possible
- On the complexity of cake cutting
- The Santa Claus problem
- Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Fairness Measures for Resource Allocation
- Cutting a Cake for Five People
- How to Cut a Cake Fairly
- A moving-knife solution to the four-person envy-free cake-division problem
- An Envy-Free Cake Division Protocol
- Algorithmic Solutions for Envy-Free Cake Cutting
- On Allocating Goods to Maximize Fairness
- MaxMin allocation via degree lower-bounded arborescences
- An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
- Cake cutting really is not a piece of cake
- Fairness in routing and load balancing
This page was built for publication: The efficiency of fair division
