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
實驗經濟學 (Experimental Economics: Behavioral Game Theory)National Taiwan University via Coursera 竞争策略（中文版）
Ludwig-Maximilians-Universität München via Coursera Welcome to Game Theory
University of Tokyo via Coursera Strategy: An Introduction to Game Theory
Indian Institute of Technology Kanpur via Swayam Теория игр
Moscow Institute of Physics and Technology via Coursera