Fully Online Matching II - Beating Ranking and Water-filling
Offered By: IEEE via YouTube
Course Description
Overview
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
Tags
Related Courses
Learning From Ranks, Learning to Rank - Jean-Philippe Vert, Google BrainAlan Turing Institute via YouTube NLP4L - Using Corpus and Learning-to-Rank for Better Search Results
BasisTech via YouTube Les coulisses des systèmes de recommandation
Université de Montréal via edX ACM ICTIR 2024 - Theoretical Aspects of Information Retrieval
Association for Computing Machinery (ACM) via YouTube Theory of Information Retrieval - ACM ICTIR 2024 Conference Presentations
Association for Computing Machinery (ACM) via YouTube