Robustness of Empirical Revenue Maximization in Auction Learning Dec 23, 2020ยท Tao Lin ยท 0 min read Abstract Presentation for our NeurIPS'20 paper “A Game-Theoretic Analysis of the Empirical Revenue Maximization Algorithm with Endogenous Sampling”. Event Institute for Theoretical Computer Science (ITCS), SUFE Location Shanghai University of Finance and Economics Shanghai, China Last updated on Dec 23, 2020 Authors Tao Lin PhD student in Computer Science ← Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions May 10, 2022