Fetching the paper…
Reading the bibliography…
In two-player zero-sum games, if both players minimize their average external regret, then the average of the strategy profiles converges to a Nash equilibrium.
Simplified two-person poker,
H. Kuhn, · 1950
Earlier work this paper cites.
Extensive games and the problem of information,
H. W. Kuhn, · 1953
Earlier work this paper cites.
The complexity of eliminating dominated strategies,
I. Gilboa, E. Kalai, E. Zemel, · 1993
Earlier work this paper cites.
M. Osborne, A. Rubenstein, A Course in Game Theory, The MIT Press, Cambridge, Massachusetts, 1994
1994
Earlier work this paper cites.
A simple adaptive procedure leading to correlated equilibrium,
S. Hart, A. Mas-Colell, · 2000
Earlier work this paper cites.
Dynamic programming for partially observable stochastic games,
E. A. Hansen, D. S. Bernstein, S. Zilberstein, · 2004
Earlier work this paper cites.
3-Nash is PPAD-complete,
X. Chen, X. Deng, · 2005
Earlier work this paper cites.
Three-player games are hard,
C. Daskalakis, C. H. Papadimitriou, · 2005
Earlier work this paper cites.
Complexity of (iterated) dominance,
V. Conitzer, T. Sandholm, · 2005
Earlier work this paper cites.
Effective short-term opponent exploitation in simplified poker,
B. Hoehn, F. Southey, R. Holte, V. Bulitko, · 2005
Earlier work this paper cites.
A competitive Texas Hold’em poker player via automated abstraction and real-time equilibrium computation,
A. Gilpin, T. Sandholm, · 2006
Earlier work this paper cites.
Settling the complexity of two-player Nash equilibrium,
X. Chen, X. Deng, · 2006
Cited alongside, same era.
The complexity of computing a Nash equilibrium,
C. Daskalakis, P. W. Goldberg, C. H. Papadimitriou, · 2006
Cited alongside, same era.
Learning, regret minimization, and equilibria,
A. Blum, Y. Mansour, · 2007
Cited alongside, same era.
No-regret algorithms for online convex programs,
G. J. Gordon, · 2007
Cited alongside, same era.
M. Zinkevich, M. Johanson, M. Bowling, C. Piccione, Regret minimization in games with incomplete information, Technical Report TR07-14, University of Alberta, 2007
2007
Cited alongside, same era.
Regret minimization in games with incomplete information,
M. Zinkevich, M. Johanson, M. Bowling, C. Piccione, · 2008
Cited alongside, same era.
Using counterfactual regret minimization to create competitive multiplayer poker agents,
N. Abou Risk, D. Szafron, · 2010
Later among the works it cites.
Accelerating best response calculation in large extensive games,
M. Johanson, M. Bowling, K. Waugh, M. Zinkevich, · 2011
Later among the works it cites.
On strategy stitching in large extensive form multiplayer games,
R. G. Gibson, D. Szafron, · 2011
Later among the works it cites.
Iterated regret minimization: A new solution concept,
J. Y. Halpern, R. Pass, · 2012
Later among the works it cites.
Finding optimal abstract strategies in extensive form games,
M. Johanson, N. Bard, N. Burch, M. Bowling, · 2012
Later among the works it cites.
Efficient nash equilibrium approximation through monte carlo counterfactual regret minimization,
M. Johanson, N. Bard, M. Lanctot, R. Gibson, M. Bowling, · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Waugh, Abstraction in large extensive games, Master’s thesis, University of Alberta, 2009
2009
Cited alongside, same era.
Minimax regret and strategic uncertainty,
L. Renou, K. H. Schlag, · 2009
Cited alongside, same era.
A practical use of imperfect recall,
K. Waugh, M. Zinkevich, M. Johanson, M. Kan, D. Schnizlein, M. Bowling, · 2009
Cited alongside, same era.
Monte carlo sampling for regret minimization in extensive games,
M. Lanctot, K. Waugh, M. Zinkevich, M. Bowling, · 2009
Cited alongside, same era.
Abstraction pathologies in extensive games,
K. Waugh, D. Schnizlein, M. Bowling, D. Szafron, · 2009
Cited alongside, same era.
Later among the works it cites.
Annual computer poker competition, http://www.computerpokercompetition.org/ , 2013. On-line; accessed 29-Apr-2013
2013
Closest in time.
Evaluating state-space abstractions in extensive-form games,
M. Johanson, N. Burch, R. Valenzano, M. Bowling, · 2013
Closest in time.
M. Lanctot, Monte Carlo sampling and regret minimization for equilibrium computation and decision-making in large extensive form games, Ph.D. thesis, University of Alberta, 2013
2013
Closest in time.
R. D. McKelvey, A. M. McLennan, T. L. Turocy, Gambit: Software tools for game theory, version 0.2010.09.01, http://www.gambit-project.org/doc/gui.html#investigating-dominated-strategies-and-actions , 2010. On-line; accessed 8-Apr-2013
2013
Closest in time.
Strategy grafting in extensive games,
K. Waugh, M. Bowling, N. Bard, · 2034
Closest in time.