Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model

06/22/2022
by   Billy Jin, et al.
0

We study the two-stage vertex-weighted online bipartite matching problem of Feng, Niazadeh, and Saberi (SODA 2021) in a setting where the algorithm has access to a suggested matching that is recommended in the first stage. We evaluate an algorithm by its robustness R, which is its performance relative to that of the optimal offline matching, and its consistency C, which is its performance when the advice or the prediction given is correct. We characterize for this problem the Pareto-efficient frontier between robustness and consistency, which is rare in the literature on advice-augmented algorithms, yet necessary for quantifying such an algorithm to be optimal. Specifically, we propose an algorithm that is R-robust and C-consistent for any (R,C) with 0 ≤ R ≤3/4 and √(1-R) + √(1-C) = 1, and prove that no other algorithm can achieve a better tradeoff.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2021

Online Matching with High Probability

We study the classical, randomized Ranking algorithm which is known to b...
research
11/12/2022

Pareto-Optimal Learning-Augmented Algorithms for Online k-Search Problems

This paper leverages machine learned predictions to design online algori...
research
04/12/2021

Online Weighted Bipartite Matching with a Sample

We study the classical online bipartite matching problem: One side of th...
research
09/22/2022

Canadian Traveller Problem with Predictions

In this work, we consider the k-Canadian Traveller Problem (k-CTP) under...
research
02/13/2019

Learning and Generalization for Matching Problems

We study a classic algorithmic problem through the lens of statistical l...
research
09/03/2021

Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems

This paper leverages machine-learned predictions to design competitive a...
research
11/26/2018

Maintaining Perfect Matchings at Low Cost

The min-cost matching problem suffers from being very sensitive to small...

Please sign up or login with your details

Forgot password? Click here to reset