Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Offered By: TheIACR via YouTube
Course Description
Overview
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.
Syllabus
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Taught by
TheIACR
Related Courses
Applied CryptographyUniversity of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera