The Algorithmic Learning in Games seminar is a joint effort between faculty at London School of Economics, the University of Waterloo, Imperial College London and, King's College London.
We meet once every fortnight to discuss problems and research in a range of topics related to:
Game Theory
Multi-Agent Reinforcement Learning
Learning in Games
Multi-Agent Systems
Recordings of our past sessions can be found here.
Next Talk
Our next session will be lead by Yannick Viossat on March 9th 2026 at 16:00 GMT. Please see further details below:
Yannick Viossat - Assistant Professor of Mathematics at Université Paris Dauphine-PSL
We will first recall standard examples of games leading to cyclical behavior of game dynamics (Matching-Pennies, Rock-Paper-Scissors, universally cyclic games, hypnodisk game). We will then show how to turn these games into examples of survival of dominated strategies by adding a feeble twin to one of the strategies. This can only occur if the dynamics favour some strategies in a way that allows the dominated strategy to survive, and we will discuss various ways this may occur. We will end up by presenting recent results on survival of dominated strategies under no-regret dynamics.
Based on joint work with: Sylvain Sorin, Josef Hofbauer, Andriy Zapechelnyuk, Panayotis Mertikopoulos, Edward Plumb, Domenico Mergoni, Bassel Tarbush, and Galit Ashkenazy.
Organisers
London School of Economics
University of Waterloo
Imperial College London
King's College London
Schedule
We intend to meet every other Monday from 16:00 - 17:00 GMT - please allow for slight changes to this schedule as needed.
Upcoming Speakers
Past Speakers
Recordings of past sessions can be found here or via the title of the respective talk in the spreadsheet below.
Sign-Up Form
We are open to any interested in joining the seminar, both as a member of the audience and as a speaker. To get in touch, please fill out the form below and we will get back to you as soon as possible.