Sublinear approximation algorithm for Nash social welfare with XOS valuations
From MaRDI portal
Cites work
- Algorithmic Game Theory
- An extension of the Nash bargaining problem and the Nash social welfare function
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- Approximating Nash social welfare under binary XOS and binary subadditive valuations
- Approximating Nash social welfare under rado valuations
- 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 combinatorial auctions with complement-free bidders
- APX-hardness of maximizing Nash social welfare with indivisible items
- Handbook of computational social choice
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- scientific article; zbMATH DE number 7651150 (Why is no real title available?)
- Maximizing Nash product social welfare in allocating indivisible goods
- 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 maximizing welfare when utility functions are subadditive
- The Nash Social Welfare Function
Cited in
(2)
This page was built for publication: Sublinear approximation algorithm for Nash social welfare with XOS valuations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906432)
