Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Communication complexity as a lower bound for learning in games

9 references·3 citing·45 second hop

FromToDepth

this work references cited by second hop

References

1998The Theory of Learning in Games2,433 cited
2001Algorithms, games, and the internet1,107 cited
2013Graphical Models for Game Theory544 cited
1999Adaptive Game Playing Using Multiplicative Weights516 cited
2000Nash convergence of gradient dynamics in general-sum games248 cited
2003A polynomial-time nash equilibrium algorithm for repeated games114 cited
2003Local-Effect Games.77 cited
2006A Continuation Method for Nash Equilibria in Structured Games73 cited
1993The Complexity of Eliminating Dominated Strategies51 cited

Cited by

2007The communication complexity of uncoupled nash equilibrium procedures33 cited
2014On the communication complexity of approximate Nash equilibria32 cited
2014Query complexity of approximate nash equilibria31 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work