scientific article; zbMATH DE number 7651150
From MaRDI portal
Publication:5874477
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
Title of this publication is not available (Why is that?)
Cites Work
- Algorithmic Game Theory
- Approximating the Nash Social Welfare with Indivisible Items
- Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- Handbook of Computational Social Choice
- Welfare bounds in the fair division problem
- On Allocating Goods to Maximize Fairness
- Optimal approximation for the submodular welfare problem in the value oracle model
- Title not available (Why is that?)
- On fair division for indivisible items
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- On maximizing welfare when utility functions are subadditive
- Earning limits in Fisher markets with spending-constraint utilities
- Approximation Algorithms for the Max-Min Allocation Problem
- Title not available (Why is that?)
- APX-hardness of maximizing Nash social welfare with indivisible items
- Nash Social Welfare, Matrix Permanent, and Stable Polynomials
- Title not available (Why is that?)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
Cited In (11)
- A Little Charity Guarantees Almost Envy-Freeness
- 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
- Approximating Nash social welfare under binary XOS and binary subadditive valuations
- Fair Division of Indivisible Goods for a Class of Concave Valuations
- Fair and efficient allocation with few agent types, few item types, or small value levels
- Approximating Nash social welfare by matching and local search
- Fair division of indivisible goods: recent progress and open questions
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)
