Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information

45 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.

Using counterfactual regret minimization to create competitive multiplayer poker agents (2010, methodology): “Ganzfried and Sandholm used techniques, involving extensions of fictitious play to compute εNash equilibriums for a 3-player Poker game in [2] and [3].”
The State of Solving Large Incomplete-Information Games, and Application to Poker (2010, background): “Solving Multiplayer Stochastic Games of Imperfect Information Significant progress has also been made on equilibrium finding in multiplayer stochastic games of imperfect information (Ganzfried and Sandholm 2008; 2009).”
Fictitious Self-Play in Extensive-Form Games (2015, background): “Despite the popularity of fictitious play to date, it has seen use in few large-scale applications, e.g. (Lambert III et al., 2005; McMahan & Gordon, 2007; Ganzfried & Sandholm, 2009; Heinrich & Silver, 2015).”