An Economics-Based Analysis of RANKING for Online Bipartite Matching

Alon Eden; Michal Feldman; Amos Fiat; Kineret Segal

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 proceeding › Conference contribution › peer-review

19 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 − ¹_e 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.

Cite this

@inproceedings{113528f02eb548a79b7d75b778f99198,

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 = "ארצות הברית",

}

Eden, A, Feldman, M, Fiat, A & Segal, K 2021, An Economics-Based Analysis of RANKING for Online Bipartite Matching. in V King & HV Le (eds), 4th Symposium on Simplicity in Algorithms, SOSA 2021. 4th Symposium on Simplicity in Algorithms, SOSA 2021, Society for Industrial and Applied Mathematics Publications, pp. 107-110, 4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021, Alexandria, United States, 11/01/21.

An Economics-Based Analysis of RANKING for Online Bipartite Matching. / Eden, Alon; Feldman, Michal; Fiat, Amos et al.
4th Symposium on Simplicity in Algorithms, SOSA 2021. ed. / Valerie King; Hung Viet Le. Society for Industrial and Applied Mathematics Publications, 2021. p. 107-110 (4th Symposium on Simplicity in Algorithms, SOSA 2021).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

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 - https://www.scopus.com/pages/publications/85110996870

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 Publications

T2 - 4th Symposium on Simplicity in Algorithms, SOSA 2021, co-located with SODA 2021

Y2 - 11 January 2021 through 12 January 2021

ER -

An Economics-Based Analysis of RANKING for Online Bipartite Matching

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this