Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 31 January 2019Accepted: 29 July 2021Published online: 30 November 2021Keywordscommunication complexity, game theory, Nash equilibriumAMS Subject Headings68Q25, 91A05Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat