Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 25-minute IEEE conference talk on fully online matching algorithms, focusing on techniques that outperform Ranking and Water-filling. Delve into the economic perspective of these algorithms, learn about Balanced Ranking, and understand the necessity of lookahead water levels. Discover the concept of Eager Water-filling and gain insights into potential future developments in this field. The presentation covers key works by Huang et al. and Karp et al., providing a comprehensive overview of the topic.
Syllabus
Intro
Fully Online Matching Huang et al. JACM 2020
Ranking Karp et al., STOC 1990
Summary
Our Results
Economic view of Ranking & Water-filling
Balanced Ranking
Why we need lookahead water level?
Eager Water-filling
Future Work
Taught by
IEEE FOCS: Foundations of Computer Science