Learning Dynamics for Nash or Coarse Correlated Equilibria in Bimatrix Games

In this talk, we will be focusing on learning in two-player games. We will provide a brief introduction on the possible behaviors of learning algorithms and will mention various techniques that have been heavily used and guarantee convergence to Nash equilibria in zero-sum games. Finally we will show how these techniques can be used to learn Nash equilibria in rank-1 games and what implications these techniques have for general-sum games.

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.