Complexity and Algorithmic Game Theory II

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=zHEEPy1NLGY


Duration: 1:09:33
1,701 views
20

Constantinos Daskalakis, Massachusetts Institute of Technology
Economics and Computation Boot Camp
http://simons.berkeley.edu/talks/constantinos-daskalakis-2015-08-27



Other Videos By Simons Institute for the Theory of Computing


2015-09-09Circuit Complexity and Connections II
2015-09-09Circuit Complexity and Connections I
2015-09-09Boolean Hardness to Randomization
2015-09-09Consequences of ETH: Tight Bounds for Various Problems
2015-09-09Recent Advances in FPT and Exact Algorithms for NP-Complete Problems
2015-09-09Consequences of SETH: Tight Bounds for Some More Problems
2015-09-09Sparsification Lemma and ETH
2015-09-09Hardness for Sequence Problems - LCS and Frechet Distance
2015-08-31Learning in Games II
2015-08-31Near-Optimal Equilibria I
2015-08-31Complexity and Algorithmic Game Theory II
2015-08-31On Algorithmic Game Theory II
2015-08-31Scarf's Lemma and Applications II
2015-08-31On Algorithmic Game Theory I
2015-08-31Scarf's Lemma and Applications I
2015-08-31Near-Optimal Equilibria II
2015-08-13Data Structures and Cryptography: from UOWHFs to PSRs
2015-08-1320 years of PIR
2015-08-06Hash Proof Systems, Old and New
2015-08-05Non-Malleable Cryptography
2015-07-15Arithmetic Cryptography


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Economics and Computation
Constantinos Daskalakis