DeepAI
Log In Sign Up

Secretary Matching with General Arrivals

11/03/2020
by   Tomer Ezra, et al.
0

We provide online algorithms for secretary matching in general weighted graphs, under the well-studied models of vertex and edge arrivals. In both models, edges are associated with arbitrary weights that are unknown from the outset, and are revealed online. Under vertex arrival, vertices arrive online in a uniformly random order; upon the arrival of a vertex v, the weights of edges from v to all previously arriving vertices are revealed, and the algorithm decides which of these edges, if any, to include in the matching. Under edge arrival, edges arrive online in a uniformly random order; upon the arrival of an edge e, its weight is revealed, and the algorithm decides whether to include it in the matching or not. We provide a 5/12-competitive algorithm for vertex arrival, and show it is tight. For edge arrival, we provide a 1/4-competitive algorithm. Both results improve upon state of the art bounds for the corresponding settings. Interestingly, for vertex arrival, secretary matching in general graphs outperforms secretary matching in bipartite graphs with 1-sided arrival, where 1/e is the best possible guarantee.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/23/2020

Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models

We provide prophet inequality algorithms for online weighted matching in...
02/07/2022

Improved Bounds for Fractional Online Matching Problems

Online bipartite matching with one-sided arrival and its variants have b...
03/11/2020

Online Graph Matching Problems with a Worst-Case Reassignment Budget

In the online bipartite matching with reassignments problem, an algorith...
04/17/2019

Online Matching with General Arrivals

The online matching problem was introduced by Karp, Vazirani and Vaziran...
04/25/2020

Online Mincut: Advice, Randomization and More

In this paper we study the mincut problem on connected graphs in the onl...
06/02/2022

Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark

In this paper, we study max-weight stochastic matchings on online bipart...
03/01/2019

Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs

We study the problem of online graph exploration on undirected graphs, w...