Regret Testing: Learning to Play Nash Equilibrium Without Knowing You Have an Opponent

By Dean Phillips Foster, H. Peyton Young. 2006

159 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/3272cab4b37c019b8fad995893d269269bc5d619

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Jeff S. Shamma
2. Jason R. Marden
3. Paul Frihauf
4. Tamer Basar
5. Andreu Mas-Colell
6. Miroslav Krstic
7. Sergiu Hart
8. Gürdal Arslan

Citations in the corpus

• Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation (2010, background): “Payoff-based learning algorithms have received significant attention recently [4, 11, 12, 20, 34].”
• Nash Equilibrium Seeking in Noncooperative Games (2012, background): “Date of publication October 25, 2011; date of current version April 19, 2012.”
• Simple Adaptive Strategies: From Regret-matching To Uncoupled Dynamics (2013, background): “" An additional stimulus for our research at this point was the work of Foster and Young (2003, 2006), Germano and Lugosi (2007), Kakade and Foster (2004), Young (2004, 2009).”