Game AI

Thinking Fast and Slow with Deep Learning and Tree Search NeurIPS 2017 Deep Exploration via Bootstrapped DQN NeurIPS 2016 Kernel Estimation and Model Combination in A Bandit Problem with Covariates JMLR 2016 On the Analysis of Complex Backup Strategies in Monte Carlo Tree Search ICML 2016 On the Use of Non-Stationary Strategies for Solving Two-Player Zero-Sum Markov Games AISTATS 2016 Why Most Decisions Are Easy in Tetris—And Perhaps in Other Sequential Decision Problems, As Well ICML 2016 Action-Conditional Video Prediction using Deep Networks in Atari Games NeurIPS 2015 Approximate Modified Policy Iteration and its Application to the Game of Tetris JMLR 2015 Multipolicy Decision-Making for Autonomous Driving via Changepoint-based Behavior Prediction RSS 2015 Trust Region Policy Optimization ICML 2015 Deep Learning for Real-Time Atari Game Play Using Offline Monte-Carlo Tree Search Planning NeurIPS 2014 Reinforcement learning with value advice ACML 2014 Universal Option Models NeurIPS 2014 Approximate Dynamic Programming Finally Performs Well in the Game of Tetris NeurIPS 2013 Convergence of Monte Carlo Tree Search in Simultaneous Move Games NeurIPS 2013 Performance Bounds for λ Policy Iteration and Application to the Game of Tetris JMLR 2013 Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions NeurIPS 2012 A reinterpretation of the policy oscillation phenomenon in approximate policy iteration NeurIPS 2011 On Strategy Stitching in Large Extensive Form Multiplayer Games NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011 Efficient Reductions for Imitation Learning AISTATS 2010 Bootstrapping from Game Tree Search NeurIPS 2009 Monte Carlo Sampling for Regret Minimization in Extensive Games NeurIPS 2009 Solving Stochastic Games NeurIPS 2009 Multi-Agent Reinforcement Learning in Common Interest and Fixed Sum Stochastic Games: An Experimental Study JMLR 2008