Fair allocation of indivisible goods: improvement
From MaRDI portal
Publication:4958554
Recommendations
Cites work
- scientific article; zbMATH DE number 5485443 (Why is no real title available?)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair enough: guaranteeing approximate maximin shares
- How to Cut A Cake Fairly
- The fair division of hereditary set systems
Cited in
(32)- An approximation algorithm for max-min fair allocation of indivisible goods
- Two birds with one stone: fairness and welfare via transfers
- Approximate maximin share allocation for indivisible goods under a knapsack constraint
- Ordinal Maximin Share Approximation for Goods
- Fair and truthful allocations under leveled valuations
- Maximin share allocation under knapsack constraints
- How to allocate hard candies fairly
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
- On best-of-both-worlds fair-share allocations
- Fairness and rank-weighted utilitarianism in resource allocation
- Fair enough: guaranteeing approximate maximin shares
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Reallocation of an infinitely divisible good
- A tight negative example for MMS fair allocations
- Approximating Nash social welfare under binary XOS and binary subadditive valuations
- An improved approximation algorithm for maximin shares
- Optimal bounds on the price of fairness for indivisible goods
- Online max-min fair allocation
- Fair Allocation of Indivisible Goods
- Obtaining a proportional allocation by deleting items
- Obtaining a proportional allocation by deleting items
- Existence of EFX for two additive valuations
- Fair division of indivisible goods: recent progress and open questions
- Improving Nash social welfare approximations of indivisible goods
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
- Fair allocation of indivisible items with conflict graphs
- Approximation Algorithms for the Max-Min Allocation Problem
- The price of connectivity in fair division
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Maximin fair allocation of indivisible items under cost utilities
This page was built for publication: Fair allocation of indivisible goods: improvement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958554)
