Communication Complexity of Combinatorial Auctions with Submodular Valuations

DOI10.1137/1.9781611973105.87zbMath1421.68213OpenAlexW4231676068MaRDI QIDQ5741796

Jan Vondrák, Shahar Dobzinski

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.87

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Submodular Functions: Learnability, Structure, and Optimization ⋮ Almost Envy-Freeness with General Valuations

This page was built for publication: Communication Complexity of Combinatorial Auctions with Submodular Valuations