TY - GEN
T1 - An Economics-Based Analysis of RANKING for Online Bipartite Matching
AU - Eden, Alon
AU - Feldman, Michal
AU - Fiat, Amos
AU - Segal, Kineret
N1 - Publisher Copyright:
Copyright © 2021 by SIAM.
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85110996870&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85110996870
T3 - 4th Symposium on Simplicity in Algorithms, SOSA 2021
SP - 107
EP - 110
BT - 4th Symposium on Simplicity in Algorithms, SOSA 2021
A2 - King, Valerie
A2 - Le, Hung Viet
PB - Society for Industrial and Applied Mathematics (SIAM)
T2 - 4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021
Y2 - 11 January 2021 through 12 January 2021
ER -