On maximizing welfare when utility functions are subadditive
From MaRDI portal
Publication:2931368
DOI10.1145/1132516.1132523zbMath1301.68270OpenAlexW1995275762MaRDI QIDQ2931368
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132523
Combinatorial optimization (90C27) Utility theory (91B16) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Randomized algorithms (68W20) Welfare economics (91B15)
Related Items (21)
On competitiveness in uniform utility allocation markets ⋮ Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Learning in auctions: regret is hard, envy is easy ⋮ Best-response dynamics in combinatorial auctions with item bidding ⋮ Approximation algorithms for inventory problems with submodular or routing costs ⋮ (Almost) efficient mechanisms for bilateral trading ⋮ Optimization with demand oracles ⋮ Combinatorial reallocation mechanisms ⋮ Energy efficient monitoring in sensor networks ⋮ PASS approximation: a framework for analyzing and designing heuristics ⋮ The balloon popping problem revisited: lower and upper bounds ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Santa Claus Meets Hypergraph Matchings ⋮ Scheduling to maximize participation ⋮ Inapproximability results for combinatorial auctions with submodular utility functions ⋮ Maximizing a class of submodular utility functions ⋮ Permutation betting markets: singleton betting with extra information ⋮ Economic efficiency requires interaction ⋮ Scheduling to Maximize Participation ⋮ Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions ⋮ Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
This page was built for publication: On maximizing welfare when utility functions are subadditive
