Approximate well-supported Nash equilibria for win-lose games
- Series
- Combinatorics Seminar
- Time
- Friday, March 14, 2014 - 15:05 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Sergey Norin – McGill University
We will explain the concept of aproximate well-supported Nash equilibrium
and show that one must consider equilibria with large supports to achieve
good approximation ratio. Our arguments use tools from probabilistic,
extremal and additive combinatorics.
Joint work with Y. Anbalagan, R. Savani and A. Vetta.