Smoothed Complexity of 2-player Nash Equilibria

Smoothed Complexity of 2-player Nash Equilibria

Explore the concept of smoothed complexity in 2-player Nash Equilibria through this 24-minute IEEE conference talk. Delve into topics such as smoothed analysis, algorithmic hardness of approximation, and algorithms for Nash equilibria. Learn about the proof overview, including reduction steps, key facts about Nash equilibria, and analysis techniques. Gain insights from speakers Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, and Aviad Rubinstein as they discuss the intricacies of game theory and computational complexity.