Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

Explore a 25-minute conference talk from Crypto 2016 that delves into the cryptographic challenges of finding a Nash Equilibrium. Learn from experts Sanjam Garg, Omkant Pandey, and Akshayaram Srinivasan as they present their research on this complex topic in game theory and cryptography. Gain insights into the intersection of these fields and understand the implications for computational complexity and security.