@inproceedings{39639ba2658b4c4f95e30f7a3c561d08,
title = "An Economics-Based Analysis of RANKING for Online Bipartite Matching",
abstract = "In their seminal paper, Karp, Vazirani and Vazirani (STOC{\textquoteright}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.",
author = "Alon Eden and Michal Feldman and Amos Fiat and Kineret Segal",
note = "Publisher Copyright: Copyright {\textcopyright} 2021 by SIAM.; 4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021 ; Conference date: 11-01-2021 Through 12-01-2021",
year = "2021",
language = "الإنجليزيّة",
series = "4th Symposium on Simplicity in Algorithms, SOSA 2021",
publisher = "Society for Industrial and Applied Mathematics Publications",
pages = "107--110",
editor = "Valerie King and Le, \{Hung Viet\}",
booktitle = "4th Symposium on Simplicity in Algorithms, SOSA 2021",
address = "الولايات المتّحدة",
}