Me and Yan Huang will be leading the class on March 15th on Counterfactual Regret Minimization. Seems to be a technique that many of the better bots have been exploring in recent contests. Reading materials include the Rubin and Watson survey paper, the paper from UAlberta that introduced this technique to poker, and Chapter 4 from this textbook Algorithmic Game Theory