Game AI

Approximate Dynamic Programming Finally Performs Well in the Game of Tetris NeurIPS 2013 Coco-Q: Learning in Stochastic Games with Side Payments ICML 2013 Competing With Strategies COLT 2013 Convergence of Monte Carlo Tree Search in Simultaneous Move Games NeurIPS 2013 Learning Prices for Repeated Auctions with Strategic Buyers NeurIPS 2013 Open Problem: Lower bounds for Boosting with Hadamard Matrices COLT 2013 Optimization, Learning, and Games with Predictable Sequences NeurIPS 2013 Regret Minimization for Branching Experts COLT 2013 A Characterization of Scoring Rules for Linear Properties COLT 2012 Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand NeurIPS 2012 Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions NeurIPS 2012 Learning Valuation Functions COLT 2012 Static Prediction Games for Adversarial Learning Problems JMLR 2012 (weak) Calibration is Computationally Hard COLT 2012 A conditional game for comparing approximations AISTATS 2011 Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011 Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011 Machine Learning Markets AISTATS 2011 On Strategy Stitching in Large Extensive Form Multiplayer Games NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011 Robust approachability and regret minimization in games with partial monitoring COLT 2011 Variance Reduction in Monte-Carlo Tree Search NeurIPS 2011 Bayesian Action-Graph Games NeurIPS 2010 Coherent Inference on Optimal Play in Game Trees AISTATS 2010 Random Walk Approach to Regret Minimization NeurIPS 2010