Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods

DOI10.1016/j.dam.2014.09.010zbMath1307.91107OpenAlexW2080780366MaRDI QIDQ477331

Trung Thanh Nguyen, Jörg Rothe

Publication date: 3 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.09.010

zbMATH Keywords

resource allocationapproximabilityeconomically motivated agents

Mathematics Subject Classification ID

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

Related Items (9)

Approximating the Nash Social Welfare with Indivisible Items ⋮ Distributed fair allocation of indivisible goods ⋮ An additive approximation scheme for the Nash social welfare maximization with identical additive valuations ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Unnamed Item ⋮ Nash Social Welfare, Matrix Permanent, and Stable Polynomials ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings ⋮ Fair in the Eyes of Others

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The efficiency of fair division
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for scheduling on parallel machines
• Ranking opportunity sets: An axiomatic approach
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
• Complexity theory and cryptology. An introduction to cryptocomplexity.
• How to Decrease the Degree of Envy in Allocations of Indivisible Goods
• Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
• Integer Programming with a Fixed Number of Variables
• The Bargaining Problem
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• On Low-Envy Truthful Allocations
• The Nash Social Welfare Function

This page was built for publication: Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods