scientific article; zbMATH DE number 7651150

DOI10.4230/LIPICS.ESA.2020.11MaRDI QIDQ5874477FDOQ5874477

Authors Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2005.07370

zbMATH Keywords

Nash social welfarediscrete fair divisionsubmodular valuationssubadditive valuations

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 7051222 (Why is no real title available?)
• scientific article; zbMATH DE number 7657254 (Why is no real title available?)
• APX-hardness of maximizing Nash social welfare with indivisible items
• Algorithmic Game Theory
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
• Approximating the Nash social welfare with budget-additive valuations
• Approximating the Nash social welfare with indivisible items
• Approximation Algorithms for the Max-Min Allocation Problem
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Earning limits in Fisher markets with spending-constraint utilities
• Handbook of Computational Social Choice
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
• Nash social welfare, matrix permanent, and stable polynomials
• On allocating goods to maximize fairness
• On fair division for indivisible items
• On maximizing welfare when utility functions are subadditive
• Optimal approximation for the submodular welfare problem in the value oracle model
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Welfare bounds in the fair division problem

Cited in

(11)

• Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
• Dividing good and great items among agents with bivalued submodular valuations
• Online Nash welfare maximization without predictions
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
• Fair division of indivisible goods: recent progress and open questions
• Approximating Nash social welfare by matching and local search
• Approximating Nash social welfare under binary XOS and binary subadditive valuations
• A Little Charity Guarantees Almost Envy-Freeness
• Fair and efficient allocation with few agent types, few item types, or small value levels
• Fair Division of Indivisible Goods for a Class of Concave Valuations

This page was built for publication:

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