On fair division for indivisible items
From MaRDI portal
Recommendations
- Improving Nash social welfare approximations of indivisible goods
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- Fair Division of Indivisible Goods for a Class of Concave Valuations
- Approximating the Nash Social Welfare with Indivisible Items
- Approximating the Nash social welfare with indivisible items
Cites work
- Approximating the Nash social welfare with budget-additive valuations
- Approximating the Nash social welfare with indivisible items
- APX-hardness of maximizing Nash social welfare with indivisible items
- Certifying algorithms
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
- Nash social welfare, matrix permanent, and stable polynomials
- The bargaining problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Welfare bounds in the fair division problem
Cited in
(26)- On the computability of equitable divisions
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations
- Dividing splittable goods evenly and with limited fragmentation
- Computing fair and efficient allocations with few utility values
- Optimal bounds on the price of fairness for indivisible goods
- Fair division of indivisible items between two players: design parameters for contested pile methods
- Implementing equal division with an ultimatum threat
- A Little Charity Guarantees Almost Envy-Freeness
- Fair Packing of Independent Sets
- Fair Division of Indivisible Goods for a Class of Concave Valuations
- Dividing splittable goods evenly and with limited fragmentation
- How to divide the indivisible
- scientific article; zbMATH DE number 7651150 (Why is no real title available?)
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
- Existence of EFX for two additive valuations
- Computing welfare-maximizing fair allocations of indivisible goods
- Computing fair and efficient allocations with few utility values
- Nash welfare guarantees for fair and efficient coverage
- Diverse fair allocations: complexity and algorithms
- Weighted fair division of indivisible items: a review
- Diverse fair allocations: complexity and algorithms
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations
- EFX exists for three agents
- Auction algorithms for market equilibrium with weak Gross substitute demands and their applications
- Brams-Taylor model of fair division for divisible and indivisible items
This page was built for publication: On fair division for indivisible items
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090961)
