Abstract
In their seminal paper, Karp, Vazirani and Vazirani (STOC’90) introduce the online bipartite matching problem, and the RANKING algorithm, which admits a tight 1 − 1e competitive ratio. Since its publication, the problem has received considerable attention, including a sequence of simplified proofs. In this paper we present a new proof that gives an economic interpretation of the RANKING algorithm — further simplifying the proof and avoiding arguments such as duality. The new proof gives a new perspective on previous proofs.
| Original language | English |
|---|---|
| Title of host publication | 4th Symposium on Simplicity in Algorithms, SOSA 2021 |
| Editors | Valerie King, Hung Viet Le |
| Publisher | Society for Industrial and Applied Mathematics Publications |
| Pages | 107-110 |
| Number of pages | 4 |
| ISBN (Electronic) | 9781713827122 |
| State | Published - 2021 |
| Externally published | Yes |
| Event | 4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021 - Alexandria, United States Duration: 11 Jan 2021 → 12 Jan 2021 |
Publication series
| Name | 4th Symposium on Simplicity in Algorithms, SOSA 2021 |
|---|
Conference
| Conference | 4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021 |
|---|---|
| Country/Territory | United States |
| City | Alexandria |
| Period | 11/01/21 → 12/01/21 |
Bibliographical note
Publisher Copyright:Copyright © 2021 by SIAM.