Online minimum matching with uniform metric and random arrivals

Document Type

Article

Publication Date

1-1-2022

Abstract

We consider Online Minimum Bipartite Matching under the uniform metric. We show that Randomized Greedy achieves a competitive ratio equal to (1+1/n)(Hn+1−1), which matches the lower bound. Comparing with the fact that RG achieves an optimal ratio of Θ(ln⁡n) for the same problem but under the adversarial order, we find that the weaker arrival assumption of random order doesn't offer any extra algorithmic advantage for RG, or make the model strictly more tractable.

Identifier

85121249774 (Scopus)

Publication Title

Operations Research Letters

External Full Text Location

https://doi.org/10.1016/j.orl.2021.12.005

ISSN

01676377

First Page

45

Last Page

49

Issue

1

Volume

50

Grant

IIS-1948157

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS