Fetching the paper…
Reading the bibliography…
Recently, there have been several high-profile achievements of agents learning to play games against humans and beat them.
A. Samuel, “July 1959.“,” Some Studies in Machine Learning Using the Game of Checkers.” IBM Journal of Research and Development , vol. 3, no. 3, pp. 210–29
1959
Earlier work this paper cites.
A. V. Oppenheim and R. W. Schafer, Digital Signal Processing , 1st ed. Pearson, 1975
1975
Earlier work this paper cites.
D. A. Pomerleau, “Alvinn: An autonomous land vehicle in a neural network,” in Advances in neural information processing systems , 1989, pp. 305–313
1989
Earlier work this paper cites.
A. Gersho and R. M. Gray, Vector Quantization and Signal Compression , ser. Technology and Engineering. Springer Science and Business Media, 1991
1991
Earlier work this paper cites.
G. Tesauro, “Temporal difference learning and td-gammon,” Communications of the ACM , vol. 38, no. 3, pp. 58–69, 1995
1995
Earlier work this paper cites.
A. Y. Ng, S. J. Russell et al. , “Algorithms for inverse reinforcement learning.” in Icml , 2000, pp. 663–670
2000
Earlier work this paper cites.
M. Campbell, A. J. Hoane Jr, and F.-h. Hsu, “Deep Blue,” Artificial intelligence , vol. 134, no. 1-2, pp. 57–83, 2002
2002
Earlier work this paper cites.
M. A. Federoff, “Heuristics and usability guidelines for the creation and evaluation of fun in video games,” Ph.D. dissertation, Citeseer, 2002
2002
Earlier work this paper cites.
P. Abbeel and A. Y. Ng, “Apprenticeship learning via inverse reinforcement learning,” in Proceedings of the twenty-first international conference on Machine learning . ACM, 2004, p. 1
2004
Earlier work this paper cites.
G. Pagès, H. Pham, and J. Printems, “Optimal quantization methods and applications to numerical problems in finance,” in Handbook of computational and numerical methods in finance . Springer, 2004, pp. 253–297
2004
Earlier work this paper cites.
J. Hoey and P. Poupart, “Solving POMDPs with continuous or large discrete observation spaces,” in IJCAI , 2005, pp. 1332–1338
2005
Earlier work this paper cites.
M. T. Spaan and N. Vlassis, “Perseus: Randomized point-based value iteration for POMDPs,” Journal of artificial intelligence research , vol. 24, pp. 195–220, 2005
2005
Earlier work this paper cites.
R. Coulom, “Efficient selectivity and backup operators in Monte-Carlo tree search,” in International conference on computers and games . Springer, 2006, pp. 72–83
2006
Earlier work this paper cites.
L. Kocsis and C. Szepesvári, “Bandit based Monte-Carlo planning,” in European conference on machine learning . Springer, 2006, pp. 282–293
2006
Earlier work this paper cites.
J. M. Porta, N. Vlassis, M. T. Spaan, and P. Poupart, “Point-based value iteration for continuous POMDPs,” Journal of Machine Learning Research , vol. 7, no. Nov, pp. 2329–2367, 2006
2006
Earlier work this paper cites.
V. Hom and J. Marks, “Automatic design of balanced board games,” in Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE) , 2007, pp. 25–30
2007
Earlier work this paper cites.
C. Thurau, T. Paczian, G. Sagerer, and C. Bauckhage, “Bayesian imitation learning in game characters,” International journal of intelligent systems technologies and applications , vol. 2, no. 2, p. 284, 2007
2007
Earlier work this paper cites.
G. Chaslot, S. Bakkes, I. Szita, and P. Spronck, “Monte-carlo tree search: A new framework for game ai.” in AIIDE , 2008
2008
Earlier work this paper cites.
A. Billard, S. Calinon, R. Dillmann, and S. Schaal, “Robot programming by demonstration,” in Springer handbook of robotics . Springer, 2008, pp. 1371–1394
2008
Earlier work this paper cites.
A. Drachen, A. Canossa, and G. N. Yannakakis, “Player modeling using self-organization in tomb raider: Underworld,” in 2009 IEEE symposium on computational intelligence and games . IEEE, 2009, pp. 1–8
2009
Earlier work this paper cites.
I. Szita, G. Chaslot, and P. Spronck, “Monte-carlo tree search in settlers of catan,” in Advances in Computer Games . Springer, 2009, pp. 21–32
2009
Earlier work this paper cites.
C. Heyden, “Implementing a computer player for carcassonne,” Ph.D. dissertation, Maastricht University, 2009
2009
Earlier work this paper cites.
B. D. Argall, S. Chernova, M. Veloso, and B. Browning, “A survey of robot learning from demonstration,” Robotics and autonomous systems , vol. 57, no. 5, pp. 469–483, 2009
2009
Earlier work this paper cites.
G. Smith, J. Whitehead, and M. Mateas, “Tanagra: A mixed-initiative level design tool,” in Proceedings of the Fifth International Conference on the Foundations of Digital Games . ACM, 2010, pp. 209–216
2010
Earlier work this paper cites.
J. Togelius, G. N. Yannakakis, K. O. Stanley, and C. Browne, “Search-based procedural content generation: A taxonomy and survey,” IEEE Transactions on Computational Intelligence and AI in Games , vol. 3, no. 3, pp. 172–186, 2011
2011
Earlier work this paper cites.
S. Ross, G. Gordon, and D. Bagnell, “A reduction of imitation learning and structured prediction to no-regret online learning,” in Proceedings of the fourteenth international conference on artificial intelligence and statistics , 2011, pp. 627–635
2011
Earlier work this paper cites.
J. Gow, R. Baumgarten, P. Cairns, S. Colton, and P. Miller, “Unsupervised modeling of player style with lda,” IEEE Transactions on Computational Intelligence and AI in Games , vol. 4, no. 3, pp. 152–166, 2012
2012
Earlier work this paper cites.
T. Mahlmann, J. Togelius, and G. N. Yannakakis, “Evolving card sets towards balancing dominion,” in Evolutionary Computation (CEC), 2012 IEEE Congress on . IEEE, 2012, pp. 1–8
2012
Cited alongside, same era.
M. Wiering and van Martijn Otterlo, Reinforcement Learning , 1st ed. Cambridge, MA, USA: Springer-Verlag Berlin Heidelberg, 2012, vol. 12
2012
Cited alongside, same era.
J. Ortega, N. Shaker, J. Togelius, and G. N. Yannakakis, “Imitating human playing styles in super mario bros,” Entertainment Computing , vol. 4, no. 2, pp. 93–104, 2013
2013
Cited alongside, same era.
A. Liapis, G. N. Yannakakis, and J. Togelius, “Sentient sketchbook: Computer-aided game level authoring.” in FDG , 2013, pp. 213–220
2013
Cited alongside, same era.
N. Shaker, M. Shaker, and J. Togelius, “Ropossum: An authoring tool for designing, optimizing and solving cut the rope levels.” in AIIDE , 2013
2017
Later among the works it cites.
2017
Later among the works it cites.
M. G. Bellemare, W. Dabney, and R. Munos, “A distributional perspective on reinforcement learning,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 2017, pp. 449–458
2017
Later among the works it cites.
Y. Duan, M. Andrychowicz, B. Stadie, O. J. Ho, J. Schneider, I. Sutskever, P. Abbeel, and W. Zaremba, “One-shot imitation learning,” in Advances in neural information processing systems , 2017, pp. 1087–1098
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
M. Kemmerling, N. Ackermann, and M. Preuss, “Making diplomacy bots individual,” in Believable Bots . Springer, 2013, pp. 265–288
2013
Cited alongside, same era.
J. F. Hughes, A. V. Dam, M. McGuire, D. F. Sklar, J. D. Foley, S. K. Feiner, and K. Akeley, Computer Graphics , 3rd ed. Addison-Wesley Professional, 2013
2013
Cited alongside, same era.
P. Cairns, A. Cox, and A. I. Nordin, “Immersion in digital games: review of gaming experience research,” Handbook of digital games , vol. 1, p. 767, 2014
2014
Cited alongside, same era.
G. N. Yannakakis, A. Liapis, and C. Alexopoulos, “Mixed-initiative co-creativity,” in Proceedings of the 9th Conference on the Foundations of Digital Games , 2014
2014
Cited alongside, same era.
D. Robilliard, C. Fonlupt, and F. Teytaud, “Monte-carlo tree search for the game of “7 wonders”,” in Computer Games . Springer, 2014, pp. 64–77
2014
Cited alongside, same era.
J. Krucher, “Algorithmically balancing a collectible card game,” Bachelor’s Thesis, ETH Zurich, 2015
2015
Cited alongside, same era.
C. Huchler, “An mcts agent for ticket to ride,” Master’s Thesis, Maastricht University, 2015
2015
Cited alongside, same era.
D. Wright, “Using word n n -grams to identify authors and idiolects,” International Journal of Corpus Linguistics , vol. 22, no. 2, pp. 212–241, 2017. [Online]. Available: http://www.jbe-platform.com/content/journals/10.1075/ijcl.22.2.03wri
2017
Later among the works it cites.
M. Andresen and H. Zinsmeister, “Approximating Style by N N -gram-based Annotation,” in Proceedings of the Workshop on Stylistic Variation , 2017, pp. 105–115
2017
Later among the works it cites.
F. D. M. Silva, I. Borovikov, J. Kolen, N. Aghdaie, and K. Zaman, “Exploring gameplay with AI agents,” in AIIDE , 2018
2018
Later among the works it cites.
I. Borovikov and A. Beirami, “Imitation learning via bootstrapped demonstrations in an open-world video game,” in NeurIPS 2018 Workshop on Reinforcement Learning under Partial Observability , Dec 2018. [Online]. Available: https://www.ias.informatik.tu-darmstadt.de/uploads/Team/JoniPajarinen/RLPO2018_paper_17.pdf
2018
Later among the works it cites.
Y. Zhao, A. Beirami, M. Sardari, N. Aghdaie, and K. Zaman, “Training agents to play modern games: Challenges and opportunities,” in NeurIPS 2018 Workshop on Reinforcement Learning under Partial Observability , Dec 2018. [Online]. Available: https://www.ias.informatik.tu-darmstadt.de/uploads/Team/JoniPajarinen/RLPO2018_paper_19.pdf
2018
Later among the works it cites.
C. Holmgard, M. C. Green, A. Liapis, and J. Togelius, “Automated playtesting with procedural personas with evolved heuristics,” IEEE Transactions on Games , 2018
2018
Later among the works it cites.
C. Guerrero-Romero, S. M. Lucas, and D. Perez-Liebana, “Using a team of general ai algorithms to assist game design and testing,” in 2018 IEEE Conference on Computational Intelligence and Games (CIG) . IEEE, 2018, pp. 1–8
2018
Later among the works it cites.
A. Summerville, S. Snodgrass, M. Guzdial, C. Holmgård, A. K. Hoover, A. Isaksen, A. Nealen, and J. Togelius, “Procedural content generation via machine learning (PCGML),” IEEE Transactions on Games , vol. 10, no. 3, pp. 257–270, 2018
2018
Later among the works it cites.
G. N. Yannakakis and J. Togelius, Artificial intelligence and games . Springer, 2018, vol. 2
2018
Later among the works it cites.
H. Baier, A. Sattaur, E. Powley, S. Devlin, J. Rollason, and P. Cowling, “Emulating human play in a leading mobile card game,” IEEE Transactions on Games , 2018
2018
Later among the works it cites.
AI & Compute, 2018, [Online, May 2018] https://blog.openai.com/ai-and-compute
2018
Later among the works it cites.
OpenAI Five, 2018, [Online, June 2018] https://openai.com/five
2018
Later among the works it cites.
M. G. Bellemare, P. S. Castro, C. Gelada, and S. Kumar, [Online, 2018] https://github.com/google/dopamine
2018
Later among the works it cites.
I. Borovikov, Y. Zhao, A. Beirami, J. Harder, J. Kolen, J. Pestrak, J. Pinto, R. Pourabolghasem et al. , “Winning isn’t everything: Training agents to playtest modern games,” in AAAI Workshop on Reinforcement Learning in Games , Jan 2019. [Online]. Available: http://aaai-rlg.mlanctot.info/papers/AAAI19-RLG-Paper36.pdf
2019
Closest in time.
I. Borovikov and A. Beirami, “From demonstrations and knowledge engineering to a DNN agent in a modern open-world video game,” in AAAI 2019 Spring Symposium on Combining Machine Learning with Knowledge Engineering , Mar 2019. [Online]. Available: https://proceedings.aaai-make.info/short2.pdf
2019
Closest in time.
2019
Closest in time.
Y. Zhao, I. Borovikov, J. Rupert, C. Somers, and A. Beirami, “On multi-agent learning in team sports games,” in ICML 2019 Workshop on Imitation, Intent, and Interaction (I3) , June 2019. [Online]. Available: https://drive.google.com/drive/folders/1rgx4G0Jl6XG20AgpoDJwnKbwBt7Ei1SJ
2019
Closest in time.
I. Borovikov, J. Harder, M. Sadovsky, and A. Beirami, “Towards a representative metric of behavior style in imitation and reinforcement learning,” in The 23rd Annual Signal and Image Sciences Workshop at Lawrence Livermore National Laboratory, Center for Advanced Signal Image Sciences (CASIS) , May 2019. [Online]. Available: https://casis.llnl.gov/content/pages/casis-2019/docs/Borovikov_CASIS_2019_NO-LLNL-IM.pdf
2019
Closest in time.
I. Borovikov and J. Harder, “Interactive Training (code base),” https://github.com/electronicarts/interactive_training
2019
Closest in time.
AlphaStar, 2019, [Online, January 2019] https://deepmind.com/blog/alphastar-mastering-real-time-strategy-game-starcraft-ii
2019
Closest in time.
F. de Mesentier Silva, R. Canaan, S. Lee, M. C. Fontaine, J. Togelius, and A. K. Hoover, “Evolving the hearthstone meta,” in IEEE Conference on Games , 2019
2019
Closest in time.
L. Mugrai, F. de Mesentier Silva, C. Holmgård, and J. Togelius, “Automated playtesting of matching tile games,” in IEEE Conference on Games , 2019
2019
Closest in time.
G. Cuccu, J. Togelius, and P. Cudré-Mauroux, “Playing atari with six neurons,” in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems . International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 998–1006
2019
Closest in time.