Simple Adaptive Strategies: From Regret-matching To Uncoupled Dynamics
By Sergiu Hart, Andreu Mas-Colell. 2013
105 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/9e5795bc400f2242b5b449b61b0409370b67cea2
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- David Balduzzi
- Thore Graepel
- Karl Tuyls
- Jakob N. Foerster
- Sergey Levine
- Shimon Whiteson
- James Martens
- Sébastien Racanière
In Computational Theory and Mathematics
- Jakob N. Foerster
- James Martens
- Thore Graepel
- David Balduzzi
- Karl Tuyls
- Bernhard Schölkopf
- Hongyuan Zha
- Shimon Whiteson
In Management Science and Operations Research
- David Balduzzi
- Thore Graepel
- Jakob N. Foerster
- Karl Tuyls
- James Martens
- Sébastien Racanière
- Alistair Letcher
- Simon Lacoste-Julien
Citations in the corpus
- Differentiable Game Mechanics (2019, background): “1 Background and problem description Tractable algorithms that converge to Nash equilibria have been found for restricted classes of games: potential games, two-player zero-sum games, and a few others (Hart and Mas-Colell, 2013). Finding Nash equilibria can be reformulated as a nonlinear complementa”
- The Mechanics of n-Player Differentiable Games (2018, background): “Procedures that converge to Nash equilibria have been found for restricted game classes: potential games, 2-player zero-sum games and a few others (Hu & Wellman, 2003; Hart & Mas-Colell, 2013).”