CSCE 631: Intelligent Agents

Course Resources

• Syllabus (Section 600, in-person)
• Syllabus (Section 700, online)
• Overview of Programming Assignments
• MAS Textbook
• Slides, links to papers, etc. will be posted to the relevant topic below.
• Overview of Course Project

Modules

	Topic	Resources	Reading
1	Foundations of Strategic Games	Games in Normal Form Solution Concepts I Solution Concepts II Example: Chess, Go	MAS, Ch. 3.1-3.3
2	Algorithms for Equilibria	Nash Equilibria -- Computational Questions Algorithms to Compute a Nash Equilibrium Computing Maxmin, Minmax Computing Correlated Equilibria Other Computational Questions	MAS, Ch. 3.4,4.1,4.2,4.4,4.6
3	Regret Minimization	Intro. to Iterative Methods Regret Min. II Regret Min. III	Sebastian Bubeck, 2011. Introduction to Online Optimization (Section 2.1). Sandholm, 2010. The State of Solving Large Incomplete-Information Games (Motivation).
4	Extensive-Form Representation	Extensive-Form, Perfect Information Extensive-Form, Imperfect Information Extensive-Form, Imperfect Information II Extensive-Form, Perfect Information II	Sebastian Bubeck, 2011. Introduction to Online Optimization (Section 2.1). Sandholm, 2010. The State of Solving Large Incomplete-Information Games (Motivation).
5	Counterfactual Regret Minimization	Vanilla CFR Sampling-Based CFR MCTS	See refs. in slides.
6	Game Abstraction	Intro. to Abstraction Practical Game Abstraction Information Abstraction Action Abstraction and Endgame Solving	See refs. in slides.
7	Case study: Poker	2-player poker, Libratus. Lecture video (Libratus) Slides (Pluribus). Video (Pluribus) Video (Rebel)	Brown & Sandholm 2018 (Libratus) Brown & Sandholm 2019 (Pluribus) Brown et al. 2020 (Rebel)
8	Opponent Modeling and Exploitation	Opponent Modeling Robust Exploitation	See refs. in slides.
9	Deep Learning	Deep CFR Regret Policy Gradient ReBeL	See refs. in slides.