Online Bipartite Matching via Smoothness

03/24/2022
by   Jason Hartline, et al.
0

The analysis of online bipartite matching of Eden et al. (2021) is a smoothness proof (Syrgkanis and Tardos, 2013). Moreover, it can be interpreted as combining a λ = 1-1/e value covering (which holds for single-dimensional agents and randomized auctions) and μ = 1 revenue covering (Hartline et al., 2014). Note that value covering is a fact about single-dimensional agents and has nothing to do with the underlying feasibility setting. Thus, the essential new result from Eden et al. (2021) is that online bipartite matching is μ=1 revenue covered.

READ FULL TEXT

page 1

page 2

research
02/14/2020

A Simple 1-1/e Approximation for Oblivious Bipartite Matching

We study the oblivious matching problem, which aims at finding a maximum...
research
02/18/2021

A Stronger Impossibility for Fully Online Matching

We revisit the fully online matching model (Huang et al., J. ACM, 2020),...
research
04/20/2018

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals

We introduce a weighted version of the ranking algorithm by Karp et al. ...
research
04/23/2023

Covering multigraphs with bipartite graphs

Hansel's lemma states that ∑_H∈ℋ|H| ≥ n log_2 n holds where ℋ is a colle...
research
02/12/2020

A Matching Mechanism with Anticipatory Tolls for Congestion Pricing

This paper presents a matching mechanism for assigning drivers to routes...
research
10/20/2021

Dynamic Bipartite Matching Market with Arrivals and Departures

In this paper, we study a matching market model on a bipartite network w...
research
11/04/2021

Single-Sample Prophet Inequalities via Greedy-Ordered Selection

We study single-sample prophet inequalities (SSPIs), i.e., prophet inequ...

Please sign up or login with your details

Forgot password? Click here to reset