atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Mechanism design augmented with output advice

NeurIPS 2024 · Learning theory and algorithms › Prediction and decision losses · approach: Algorithms with explicit predictors · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Introduces mechanism design with output advice (a recommended outcome rather than predicted types), measured by a new "quality of recommendation" metric, and derives consistency/robustness/smoothness results for facility location, scheduling, house allocation, and auctions.

Problem

Strategyproof mechanism design with machine-learned advice about the outcome (not the agent types), where performance should degrade gracefully with the quality of the recommended outcome.

Approach

Replace type-prediction error with a universal quality-of-recommendation metric: the approximation ratio of the recommended outcome's cost (or welfare) to the optimum on the true input. The recommendation is plugged into existing mechanisms (minimum bounding box, coordinatewise median with predictions, AllocationScaledGreedy, TTC, maximal-in-range VCG) to obtain refined bounds.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use recommendation quality $\err$ to analyze Minimum Bounding BoxFacility Location (egalitarian) · Facility Location (egalitarian)approximation ratio: $\min\{\err, \sqrt{2}+1\}$Helped
use recommendation quality $\err$ to analyze Coordinatewise Median with PredictionsFacility Location (utilitarian) · Facility Location (utilitarian)approximation ratio: $\min\{\sqrt{2}\err, \err + \sqrt{2}, \frac{\sqrt{2\lambda^2+2}}{1-\lambda}\}$Helped
add output recommendation and tune confidence parameter $\beta$AllocationScaledGreedy · Unrelated-machine scheduling (makespan)approximation ratio: $\min\{(\beta + 1)\err, n+\err, \frac{n^2}{\beta}\}$Helped
use the recommendation as the initial endowment for TTCHouse Allocation · House Allocation (unit-range valuations)approximation ratio: $\min\{\err, n\}$Helped
add the recommended outcome to the maximal-in-range mechanism's rangeCombinatorial auctions · Combinatorial auctionsapproximation ratio: $\min\{\err, \rho_M\}$Helped
use quality of recommendation $\err$ rather than prediction error $\eta$ for the utilitarian facility-location analysisCoordinatewise Median with Predictions · Facility Location (utilitarian)approximation ratio bound accuracy: $\sqrt{2}\err = 1.618$; $\frac{\sqrt{2\lambda^2+2}}{1+\lambda} + \eta > 1 + \eta = 1.707$Helped
use quality of recommendation $\err$ rather than prediction error $\eta$ for the egalitarian facility-location analysisMinimum Bounding Box · Facility Location (egalitarian)approximation ratio bound accuracy: $\err = \sqrt{2.5} \approx 1.581$; $\eta= 1/\sqrt{2} \approx 0.707Helped

Surprising findings

Limitations

Experimental setup

Datasets: Twitter Brightkite Gowalla Earthquake Autotel

Benchmarks: Twitter Brightkite Gowalla Earthquake Autotel

Metrics: quality of recommendation prediction error eta approximation ratio

Baselines: Minimum Bounding Box mechanism Coordinatewise Median with Predictions SimpleScaledGreedy ScaledGreedy VCG

Builds on: learning-augmented framework (consistency and robustness) Coordinatewise Median with Predictions SimpleScaledGreedy / ScaledGreedy maximal-in-range VCG

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy