Mechanism design augmented with output advice
George Christodoulou, Alkmini Sgouritsa, Ioannis Vlachos
Abstract
Our work revisits the design of mechanisms via the learning-augmented framework. In this model, the algorithm is enhanced with imperfect (machine-learned) information concerning the input, usually referred to as prediction. The goal is to design algorithms whose performance degrades gently as a function of the prediction error and, in particular, perform well if the prediction is accurate, but also provide a worst-case guarantee under any possible error. This framework has been successfully applied recently to various mechanism design settings, where in most cases the mechanism is provided with a prediction about the types of the players. We adopt a perspective in which the mechanism is provided with an output recommendation. We make no assumptions about the quality of the suggested outcome, and the goal is to use the recommendation to design mechanisms with low approximation guarantees whenever the recommended outcome is reasonable, but at the same time to provide worst-case guarantees whenever the recommendation significantly deviates from the optimal one. We propose a generic, universal measure, which we call quality of recommendation, to evaluate mechanisms across various information settings. We demonstrate how this new metric can provide refined analysis in existing results. This model introduces new challenges, as the mechanism receives limited information comparing to settings that use predictions about the types of the agents. We study, through this lens, several well-studied mechanism design paradigms, devising new mechanisms, but also providing refined analysis for existing ones, using as a metric the quality of recommendation. We complement our positive results, by exploring the limitations of known classes of strategyproof mechanisms that can be devised using output recommendation.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 069ac4ee-53de-443c-a71d-7a3b18d82111Cited by top-tier papers7
- Randomized Strategic Facility Location with PredictionsEric Balkanski, Vasilis Gkatzelis, Golnoosh ShahkaramiNeurIPS 2024 · 29 citations
- Multi-Platform Autobidding with and without PredictionsGagan Aggarwal, Anupam Gupta, Xizhi Tan, Mingfei ZhaoWWW 2025 · 7 citations
- Improving the Price of Anarchy via Predictions in Parallel-Link NetworksGeorge Christodoulou, Vasilis Christoforidis, Alkmini Sgouritsa, Ioannis VlachosWWW 2026 · 3 citations
- Procurement Auctions with Predictions: Improved Frugality for Facility LocationEric Balkanski, Nicholas DeFilippis, Vasilis Gkatzelis, Xizhi TanNeurIPS 2025 · 2 citations
- Parsimonious Predictions for Strategyproof SchedulingRichard Cole, Anupam Gupta, Pranav JangirNeurIPS 2025 · 2 citations
Builds on5
- Online metric algorithms with untrusted predictionsAntonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak et al.ICML 2020 · 170 citations
- Online Facility Location with Multiple AdviceMatteo Almanza, Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi et al.NeurIPS 2021 · 45 citations
- Bicriteria Multidimensional Mechanism Design with Side InformationSiddharth Prasad, Maria-Florina Balcan, Tuomas SandholmNeurIPS 2023 · 26 citations
- A Proof of the Nisan-Ronen ConjectureGeorge Christodoulou, Elias Koutsoupias, Annamária KovácsSTOC 2023 · 10 citations
- Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation GuaranteesFrederick V. Qiu, S. Matthew WeinbergSTOC 2024 · 1 citation
Related papers
- Knowing Who, Not How Much: Learning-Augmented Mechanisms for Consumer Utility MaximizationKira Goldner, Divyarthi Mohan, Thodoris TsilivisICML 2026 · 2 citations
- Fair Secretaries with Unfair PredictionsEric Balkanski, Will Ma, Andreas MaggioriNeurIPS 2024 · 9 citations
- Clock Auctions Augmented with Unreliable AdviceVasilis Gkatzelis, Daniel Schoepflin, Xizhi TanSODA 2025 · 2 citations
- Plant-and-Steal: Truthful Fair Allocations via PredictionsIlan Reuven Cohen, Alon Eden, Talya Eden, Arsen VasilyanNeurIPS 2024 · 9 citations
- Learning-Augmented Priority QueuesZiyad Benomar, Christian CoesterNeurIPS 2024 · 13 citations
