scientific article; zbMATH DE number 6542796
From MaRDI portal
Publication:5744805
zbMath1351.91008arXiv1302.3116MaRDI QIDQ5744805
Paul W. Goldberg, Rahul Savani, John Fearnley, Martin Gairing
Publication date: 19 February 2016
Full work available at URL: https://arxiv.org/abs/1302.3116
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Rationality and learning in game theory (91A26)
Related Items (15)
Query Complexity of Approximate Equilibria in Anonymous Games ⋮ Generalized mirror descents in congestion games ⋮ Query complexity of approximate equilibria in anonymous games ⋮ Learning convex partitions and computing game-theoretic equilibria from best response queries ⋮ Distributed Methods for Computing Approximate Equilibria ⋮ Exploiting extensive-form structure in empirical game-theoretic analysis ⋮ Unnamed Item ⋮ Logarithmic query complexity for approximate Nash computation in large games ⋮ Distributed methods for computing approximate equilibria ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Logarithmic Query Complexity for Approximate Nash Computation in Large Games ⋮ Unnamed Item ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Optimally Deceiving a Learning Leader in Stackelberg Games
Uses Software
This page was built for publication:
