Prophet inequality for bipartite matching: merits of being simple and non adaptive

02/17/2019
by   Nick Gravin, et al.
0

We consider Bayesian online selection problem of a matching in bipartite graphs, i.e., online weighted matching problem with edge arrivals where online algorithm knows distributions of weights, that corresponds to the intersection of two matroids in [Kleinberg and Wienberg STOC 12] model. We consider a simple class of non adaptive vertex-additive policies that assign static prices to all vertices in the graph and accept each edge only if its weight exceeds the sum of the prices of the edge's endpoints. We show existence of a vertex-additive policy with the expected payoff of at least one third of the prophet's payoff and present gradient decent type algorithm that quickly converges to the desired vector of vertex prices. This improves the adaptive online policy of [Kleinberg and Wienberg STOC 12] for the intersection of two matroids in two ways: our policy is non adaptive and has better approximation guarantee of 3 instead of previous guarantee of 5.82 against the prophet. We give a complementary lower bound of 2.25 for any online algorithm in the bipartite matching setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2021

Prophet Inequalities for Matching with a Single Sample

We consider the prophet inequality problem for (not necessarily bipartit...
research
12/14/2021

Secretary Matching With Vertex Arrivals and No Rejections

Most prior work on online matching problems has been with the flexibilit...
research
06/27/2018

Online Matching in a Ride-Sharing Platform

We propose a formal graph-theoretic model for studying the problem of ma...
research
03/04/2021

An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem

In the weighted bipartite matching problem, the goal is to find a maximu...
research
08/05/2022

Sublinear Time Algorithm for Online Weighted Bipartite Matching

Online bipartite matching is a fundamental problem in online algorithms....
research
06/29/2021

Restricted Adaptivity in Stochastic Scheduling

We consider the stochastic scheduling problem of minimizing the expected...
research
07/13/2023

Stackelberg Vertex Cover on a Path

A Stackelberg Vertex Cover game is played on an undirected graph 𝒢 where...

Please sign up or login with your details

Forgot password? Click here to reset