The efficiency of fair division
From MaRDI portal
Recommendations
Cites work
- 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 approximation algorithm for max-min fair allocation of indivisible goods
- An Envy-Free Cake Division Protocol
- 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 in routing and load balancing
- Fairness Measures for Resource Allocation
- How to Cut a Cake Fairly
- 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?)
- 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 fair allocation of an indivisible good when monetary compensations are possible
- The Price of Stability for Network Design with Fair Cost Allocation
- The Santa Claus problem
Cited in
(66)- A fair division approach to humanitarian logistics inspired by conditional value-at-risk
- Price of fairness in two-agent single-machine scheduling problems
- Price of fairness for allocating a bounded resource
- On the computability of equitable divisions
- Local fairness in hedonic games via individual threshold coalitions
- Fairness and efficiency for allocations with participation constraints
- Allocating contiguous blocks of indivisible chores fairly
- The price of fairness for a two-agent scheduling game minimizing total completion time
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
- Fair division in the presence of externalities
- The price of fairness for indivisible goods
- How to obtain an equitable optimal fair division
- On social envy-freeness in multi-unit markets
- Fair and square: cake-cutting in two dimensions
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Fair and efficient allocation with few agent types, few item types, or small value levels
- Optimal bounds on the price of fairness for indivisible goods
- On fairness via picking sequences in allocation of indivisible goods
- A parametric worst-case approach to fairness in cooperative games with transferable utility
- The price of fairness for a small number of indivisible items
- Dividing connected chores fairly
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
- The price of fairness
- Truthful Fair Division
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- A further analysis of the dynamic dominant resource fairness mechanism
- scientific article; zbMATH DE number 2153479 (Why is no real title available?)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- Implementing equal division with an ultimatum threat
- Dividing connected chores fairly
- Efficient Fair Division with Minimal Sharing
- Fair Division
- 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
- 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
- EFX allocations exist for binary valuations
- Maximize egalitarian welfare for cake cutting
- Fair algorithm design: fair and efficacious machine scheduling
- The price of equity with binary valuations and few agent types
- Optimizing over serial dictatorships
- Envy-free relaxations for goods, chores, and mixed items
- Penalties and rewards for fair learning in paired kidney exchange programs
- The price of anarchy of probabilistic serial in one-sided allocation problems
- Optimizing over serial dictatorships
- Welfare loss in connected resource allocation
- Proportional allocations of multi-layered cakes
- On the price of fairness of allocating contiguous blocks
- The price of EF1 for few agents with additive ternary valuations
- The price of fairness for budget-feasible EF1 allocations
- Fair distribution of delivery orders
- Weighted EF1 allocations for indivisible chores
- Trade-off between utility and fairness in two-agent single-machine scheduling
- Analyzing the price of fairness in scheduling problems with two agents
- Envy-free and efficient allocations for graphical valuations
- Truthful cake sharing
- Scheduling with locality by routing
- Achieving envy-freeness through items sale
- Optimal seat arrangement: what are the hard and easy cases?
- Nearly tight bounds on the price of fairness for indivisible items under budget constraints
- A fair allocation is approximately optimal for indivisible chores, or is it?
- Fair and efficient cake division with connected pieces
- Truthful fair division without free disposal
- The price of envy-freeness in machine scheduling
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)
