Revisiting Game Representations: The Hidden Costs of Efficiency in Sequential Decision-making Algorithms

Kuhn, H.W.: A simplified two-person poker. Contributions to the Theory of Games 1

1950

Earlier work this paper cites.

Harsanyi, J.C.: Games with incomplete information played by “Bayesian” players, I–III, part I. the basic model. Management science 14

Original

1967

Earlier work this paper cites.

Fudenberg, D., Tirole, J.: Game theory, 1991. Cambridge, Massachusetts 393

1991

Earlier work this paper cites.

Koller, D., Megiddo, N., Von Stengel, B.: Fast algorithms for finding randomized strategies in game trees. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, pp. 750–759 (1994)

1994

Earlier work this paper cites.

Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT press, Massachusetts (1994)

1994

Earlier work this paper cites.

Battigalli, P., Siniscalchi, M.: Rationalization and incomplete information. Advances in Theoretical Economics 3

2003

Earlier work this paper cites.

Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic game theory, 2007. Google Scholar Google Scholar Digital Library Digital Library

2007

Earlier work this paper cites.

Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Advances in Neural Information Processing Systems, pp. 1729–1736 (2008)

2008

Earlier work this paper cites.

Johanson, M., Waugh, K., Bowling, M., Zinkevich, M.: Accelerating best response calculation in large extensive games. In: IJCAI, vol. 11, pp. 258–265 (2011)

2011

Earlier work this paper cites.

Johanson, M., Bard, N., Lanctot, M., Gibson, R.G., Bowling, M.: Efficient nash equilibrium approximation through monte carlo counterfactual regret minimization. In: AAMAS, pp. 837–846 (2012). Citeseer

2012

Earlier work this paper cites.

Bard, N., Hawkin, J., Rubin, J., Zinkevich, M.: The annual computer poker competition. AI Magazine 34

2013

Earlier work this paper cites.

Burch, N., Johanson, M., Bowling, M.: Solving imperfect information games using decomposition. In: AAAI, pp. 602–608 (2014)

2014

Earlier work this paper cites.

Tammelin, O.: Solving large imperfect information games using cfr+. arXiv preprint arXiv:1407.5042 (2014)

Original

2014

Cited alongside, same era.

Tammelin, O., Burch, N., Johanson, M., Bowling, M.: Solving heads-up limit Texas hold’em. In: Twenty-fourth International Joint Conference on Artificial Intelligence (2015)

2015

Cited alongside, same era.

Moravcik, M., Schmid, M., Burch, N., Lisý, V., Morrill, D., Bard, N., Davis, T., Waugh, K., Johanson, M., Bowling, M.: Deepstack: Expert-level artificial intelligence in heads-up no-limit poker. Science 356

2017

Cited alongside, same era.

Brown, N., Sandholm, T.: Superhuman AI for heads-up no-limit poker: Libratus beats top professionals. Science 359

2018

Cited alongside, same era.

Brown, N., Sandholm, T.: Superhuman ai for multiplayer poker. Science (6456), 885–890 (2019)

Farina, G., Kroer, C., Sandholm, T.: Online convex optimization for sequential decision processes and extensive-form games. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1917–1925 (2019)

2019

Later among the works it cites.

Zhang, B., Sandholm, T.: Sparsified linear programming for zero-sum equilibrium finding. In: International Conference on Machine Learning, pp. 11256–11267 (2020). PMLR

2020

Later among the works it cites.

Zamir, S.: Bayesian Games: Games with Incomplete Information. Springer, ??? (2020)

2020

Later among the works it cites.

Brown, N., Bakhtin, A., Lerer, A., Gong, Q.: Combining deep reinforcement learning and search for imperfect-information games. arXiv preprint arXiv:2007.13544 (2020)

Original

2020

Later among the works it cites.

Kovařík, V., Schmid, M., Burch, N., Bowling, M., Lisỳ, V.: Rethinking formal models of partially observable multiagent decision making. Artificial Intelligence, 103645 (2021)