Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games

Paul W. Goldberg, Matthew J. Katzman. Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games. In Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, editors, Algorithmic Game Theory - 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings. Volume 12885 of Lecture Notes in Computer Science, pages 124-139, Springer, 2021. [doi]

Abstract

Abstract is missing.