Title: Online Bipartite Matchings: a Gentle Introduction to Competitive Analysis and Recent Advances

Speaker: Professor Seffi Naor

Summary:
The talk will introduce the notion of competitive analysis of online algorithms through several examples. Then, we will focus on the online bipartite matching problem, studying several facets of it, and discussing both classical results and some recent advances.

Biography:
Seffi Naor is an ACM Fellow and Professor of Computer Science at the Technion – Israel Institute of Technology, where he has been on the faculty since 1991. Prior to that, he was a postdoctoral fellow at at Stanford University and the University of Southern California. During 1998-2000 he was a member of the technical staff at Bell Laboratories, Lucent Technologies. During 2005-2007, he was a visiting researcher at Microsoft Research. Over the years he has been a regular visitor at IBM Research, Bell Labs, and Microsoft Research.

Seffi Naor’s research interests are mainly in the design and analysis of efficient algorithms, in particular approximation algorithms for NP-Hard algorithms and online algorithms, algorithmic game theory, and complexity theory. He has published over 150 papers in top professional journals and conferences. He is currently on the editorial board of the ACM Transactions on Algorithms and ACM Books and has served as chair of the program committee for the 2022 ACM-SIAM Symposium on Discrete Algorithms.

Registrations essential: Book your place by clicking on this link
Light lunch will be provided prior to event

Hybrid Event: Zoom and In Person
ZOOM MEETING ID: 873 1557 5255; PASSWORD: 778635

WED 21 FEBRUARY 2024 13.00 – 14.00 (AEDT, Melbourne Time)