A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders
Dimitris Fotakis, Kyriakos Lotidis, Chara Podimata

TL;DR
This paper develops truthful mechanisms for combinatorial auctions with submodular bidders that approximate liquid welfare effectively, extending known methods and introducing market assumptions for improved performance.
Contribution
It adapts existing truthful mechanisms to optimize liquid welfare in budget-constrained combinatorial auctions, including new results for large markets and Bayesian settings.
Findings
Achieves an $O(\log m)$-approximate mechanism for liquid welfare.
Introduces the concept of competitive markets for constant-factor approximation.
Provides a truthful $O(1)$-approximate mechanism in Bayesian settings.
Abstract
We study incentive compatible mechanisms for Combinatorial Auctions where the bidders have submodular (or XOS) valuations and are budget-constrained. Our objective is to maximize the \emph{liquid welfare}, a notion of efficiency for budget-constrained bidders introduced by Dobzinski and Paes Leme (2014). We show that some of the known truthful mechanisms that best-approximate the social welfare for Combinatorial Auctions with submodular bidders through demand query oracles can be adapted, so that they retain truthfulness and achieve asymptotically the same approximation guarantees for the liquid welfare. More specifically, for the problem of optimizing the liquid welfare in Combinatorial Auctions with submodular bidders, we obtain a universally truthful randomized -approximate mechanism, where is the number of items, by adapting the mechanism of Krysta and V\"ocking…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
