Speaker: Prof. Jie Zhang, University of Bath

Time: 11:00 a.m., May 23, 2024, GMT+8

Venue: Room 204, Courtyard No.5, Jingyuan

Abstract: 

Algorithmic game theory aims to design efficient algorithms to solve complex games, analyze their equilibria, and compare the advantages and disadvantages of different equilibria. Mechanism design focuses on creating incentive-compatible mechanisms that ensure participants reveal their true preferences and information. This report will summarize some recent advancements made by my collaborators and me, covering issues such as matching, facility location, and voting. The emphasis will be on the differences in approximation ratios of various mechanisms under average-case and Bayesian analysis compared to worst-case scenarios, using methods such as smoothed analysis and optimal transport.

Source: Center on Frontiers of Computing Studies, PKU