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

DOI10.1016/J.DAM.2014.09.010zbMATH Open1307.91107OpenAlexW2080780366MaRDI QIDQ477331FDOQ477331

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)

Cites Work

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

Cited In (14)

• Approximating the Nash Social Welfare with Indivisible Items
• Title not available (Why is that?)
• Nash Social Welfare, Matrix Permanent, and Stable Polynomials
• Fair in the Eyes of Others
• Generalized binary utility functions and fair allocations
• Maximizing Nash product social welfare in allocating indivisible goods
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
• Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities
• An additive approximation scheme for the Nash social welfare maximization with identical additive valuations
• Distributed fair allocation of indivisible goods
• Fair and efficient allocation with few agent types, few item types, or small value levels
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
• Extending the characterization of maximum Nash welfare
• A characterization of maximum Nash welfare for indivisible goods

Uses Software

• LEDA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477331)