Online Matching with KIID Edge Arrivals
This paper studies online stochastic matching in an edge arrival model, showing that competitive ratios better than 1-1/e are possible.
The paper introduces a new edge arrival model and shows that competitive ratios better than 1-1/e are possible, which is a novel result compared to previous work.
Before reading this…
To understand this paper, make sure you know these concepts first:
- bipartite type-graphfind papers →
- Natural LPfind papers →
Abstract
More Like ThisIn the classic online stochastic matching proposed by Feldman et al. (FOCS 2009), there is a known bipartite type-graph, where one side of the graph is given offline. Upon the arrival of each online vertex, its type is sampled independently and identically from the other side of the type-graph. This model has been extensively studied over the past decade, yielding a rich body of theoretical results. In this paper, we initiate the study of an edge arrival model for online stochastic matching. In our model, the online edges are sampled independently and identically (KIID) from a known type-graph, which need not be bipartite. We first show that the Greedy algorithm cannot achieve a competitive ratio strictly better than $0.5$ while the Suggested Matching algorithm has a competitive ratio of $1-1/e$ under the assumption of integral arrival rates, matching its performance in the one-sided vertex arrival model. We then propose a two-stage algorithm that combines Greedy and Suggested Matching, and show that its competitive ratio is strictly higher than $1-1/e$ for integral arrival rates. While our algorithm is simple, its analysis is intricate and builds upon the Natural LP, which has been proven very powerful in vertex arrival models. Our result reveals that even in the more challenging edge arrival setting for general graphs, competitive ratios better than $1-1/e$ are still possible, given the known distributions.