On March 16, 2021, at the Discrete Math Seminar, Se-Young Yun (윤세영) from KAIST gave a talk on a theoretical analysis of recommendation systems in an online setting, not only proving a lower bound on the regret but also providing an algorithm almost matching these lower bounds. The title of his talk was “Regret in Online Recommendation Systems“.