Complexity and Algorithmic Game Theory I
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=3U8bqeydjK0
66Constantinos Daskalakis, Massachusetts Institute of Technology
Economics and Computation Boot Camp
http://simons.berkeley.edu/talks/constantinos-daskalakis-2015-08-26
Other Videos By Simons Institute for the Theory of Computing
| 2015-09-09 | Circuit Complexity and Connections II |
| 2015-09-09 | Circuit Complexity and Connections I |
| 2015-09-09 | Boolean Hardness to Randomization |
| 2015-09-09 | Consequences of ETH: Tight Bounds for Various Problems |
| 2015-09-09 | Recent Advances in FPT and Exact Algorithms for NP-Complete Problems |
| 2015-09-09 | Consequences of SETH: Tight Bounds for Some More Problems |
| 2015-09-09 | Sparsification Lemma and ETH |
| 2015-09-09 | Hardness for Sequence Problems - LCS and Frechet Distance |
| 2015-08-31 | Learning in Games II |
| 2015-08-31 | Near-Optimal Equilibria I |
| 2015-08-31 | Complexity and Algorithmic Game Theory I |
| 2015-08-31 | On Algorithmic Game Theory II |
| 2015-08-31 | Scarf's Lemma and Applications II |
| 2015-08-31 | On Algorithmic Game Theory I |
| 2015-08-31 | Scarf's Lemma and Applications I |
| 2015-08-31 | Near-Optimal Equilibria II |
| 2015-08-13 | Data Structures and Cryptography: from UOWHFs to PSRs |
| 2015-08-13 | 20 years of PIR |
| 2015-08-06 | Hash Proof Systems, Old and New |
| 2015-08-05 | Non-Malleable Cryptography |
| 2015-07-15 | Arithmetic Cryptography |
Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Economics and Computation
Constantinos Daskalakis