Procurement Auctions with Predictions: Improved Frugality for Facility Location
Eric Balkanski, Nicholas DeFilippis, Vasilis Gkatzelis, Xizhi Tan
Abstract
We study the problem of designing procurement auctions for the strategic uncapacitated facility location problem: a company needs to procure a set of facility locations in order to serve its customers and each facility location is owned by a strategic agent. Each owner has a private cost for providing access to their facility (e.g., renting it or selling it to the company) and needs to be compensated accordingly. The goal is to design truthful auctions that decide which facilities the company should procure and how much to pay the corresponding owners, aiming to minimize the total cost, i.e., the monetary cost paid to the owners and the connection cost suffered by the customers (their distance to the nearest facility). We evaluate the performance of these auctions using the frugality ratio. We first analyze the performance of the classic VCG auction in this context and prove that its frugality ratio is exactly . We then leverage the learning-augmented framework and design auctions that are augmented with predictions regarding the owners'private costs. Specifically, we propose a family of learning-augmented auctions that achieve significant payment reductions when the predictions are accurate, leading to much better frugality ratios. At the same time, we demonstrate that these auctions remain robust even if the predictions are arbitrarily inaccurate, and maintain reasonable frugality ratios even under adversarially chosen predictions. We finally provide a family of ``error-tolerant''auctions that maintain improved frugality ratios even if the predictions are only approximately accurate, and we provide upper bounds on their frugality ratio as a function of the prediction error.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on10
- The Primal-Dual method for Learning Augmented AlgorithmsÉtienne Bamas, Andreas Maggiori, Ola SvenssonNeurIPS 2020 · 171 citations
- Secretary and Online Matching Problems with Machine Learned AdviceAntonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel KolevNeurIPS 2020 · 167 citations
- Online Knapsack with Frequency PredictionsSungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish PurohitNeurIPS 2021 · 70 citations
- Randomized Strategic Facility Location with PredictionsEric Balkanski, Vasilis Gkatzelis, Golnoosh ShahkaramiNeurIPS 2024 · 29 citations
- MAC Advice for facility location mechanism designZohar Barak, Anupam Gupta, Inbal Talgam-CohenNeurIPS 2024 · 26 citations
Related papers
- Improved Bounds for Online Facility Location with PredictionsDimitris Fotakis, Evangelia Gergatsouli, Themistoklis Gouleakis, Nikolas Patris et al.AAAI 2025 · 16 citations
- Clock Auctions Augmented with Unreliable AdviceVasilis Gkatzelis, Daniel Schoepflin, Xizhi TanSODA 2025 · 2 citations
- Online Allocation and Learning in the Presence of Strategic AgentsSteven Yin, Shipra Agrawal, Assaf ZeeviNeurIPS 2022 · 3 citations
- Competitive Fair Scheduling with PredictionsTianming Zhao, Chunqiu Xia, Xiaomin Chang, Chunhao Li et al.ICLR 2025
- Learning-Augmented Facility Location Mechanisms for Envy RatioHaris Aziz, Yuhang Guo, Alexander Lam, Houyu ZhouNeurIPS 2025 · 1 citation
