Date:
Sun, 21/01/202414:00
Game Theory and Mathematical Economics Research Seminar
Lecturer:
Prof. Yakov Babichenko (Technion)
Title:
Communication complexity of Nash equilibria in potential games
Abstract:
The first part of the talk will provide general background on the complexity of equilibria in three complexity models: query complexity, communication complexity, and computational complexity with an emphasis on the communication complexity model.
The second part of the talk will consider potential games and congestion games. Lower bounds on the communication complexity of pure Nash equilibria and Nash equilibria (possibly mixed) will be provided.
This is a joint work with Shahar Dobzinski Noam Nisan, and Aviad Rubinstein.
Location:
Eilan Hall, Feldman Building, Second Floor, Edmond Safra Campus.