An Economics-Based Analysis of RANKING for Online Bipartite Matching

Alon Eden, Michal Feldman, Amos Fiat, Kineret Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

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 languageAmerican English
Title of host publication4th Symposium on Simplicity in Algorithms, SOSA 2021
EditorsValerie King, Hung Viet Le
PublisherSociety for Industrial and Applied Mathematics Publications
Pages107-110
Number of pages4
ISBN (Electronic)9781713827122
StatePublished - 2021
Externally publishedYes
Event4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021 - Alexandria, United States
Duration: 11 Jan 202112 Jan 2021

Publication series

Name4th Symposium on Simplicity in Algorithms, SOSA 2021

Conference

Conference4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021
Country/TerritoryUnited States
CityAlexandria
Period11/01/2112/01/21

Bibliographical note

Publisher Copyright:
Copyright © 2021 by SIAM.

Fingerprint

Dive into the research topics of 'An Economics-Based Analysis of RANKING for Online Bipartite Matching'. Together they form a unique fingerprint.

Cite this