A paper titled "Edge-Weighted Online Bipartite Matching", which was co-authored by Dr Zhiyi Huang with collaborators from Google Research (Matthew Fahrbach & Morteza Zadimorghaddam) and Columbia University (Runzhou Tao, former HKU-CS Summer Intern), received the Best Paper Award at the 61st Annual IEEE Symposium on Foundations of Computer Science held virtually from November 16-19, 2020.
The problem of the paper was proposed by Google researchers to model online advertising, which generates tens of billions of USD annually. Dr. Huang and collaborators came up with the first algorithm that outperform the greedy algorithm, which has remained the state of the art for more than 10 years, despite many attempts to find better alternatives. With Dr. Huang’s work, this is the first time in 14 years that a scholar from Asia receives the prestigious FOCS Best Paper Award.
For more details, there is a post in Chinese at the WeChat account of the Institute for Interdisciplinary Information Sciences (IIIS), Tsinghua University.
