← Core AI
Artificial Intelligence › Core AI ›

Game AI

1774 directly classified papers

Papers per year

Papers

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