Methods for empirical game-theoretic analysis (extended abstract)

By Michael P. Wellman. 2006

51 citations recorded by the source corpus.

How researchers see this paper

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

1. Marc Lanctot
2. Joel Z. Leibo
3. Vinícius Flores Zambaldi
4. Yuxi Li
5. Jakob N. Foerster
6. Thore Graepel
7. Yoshua Bengio
8. Tuomas Sandholm

Citations in the corpus

• Multi-agent Reinforcement Learning in Sequential Social Dilemmas (2017, methodology): “This definition is based on a formalization of empirical game-theoretic analysis [20, 21].”
• Lossy stochastic game abstraction with bounds (2012, methodology): “Similarly, when abstraction is used for reason (ii) or (iii) above, it is typically done manually [Wellman 2006; Archibald and Shoham 2009].”
• The State of Solving Large Incomplete-Information Games, and Application to Poker (2010, background): “An extreme form of action abstraction is to restrict analysis to a small number of strategies and conduct equilibrium analysis among them (Wellman 2006).”