Algorithmic Game Theory & ML Program
Complete university lecture series taught by Simons Institute for the Theory of Computing.
Simons Institute research symposium investigating the algorithmic and complexity-theoretic foundations of non-convex optimization, overparameterized generalization, and statistical-computational gaps.
Self-contained public lectures, keynote addresses, and research seminars.
Rigorous 87-minute Simons Institute tutorial at the intersection of algorithmic game theory, Shapley data valuation, federated learning, and coalition stability.
UC Berkeley Simons Institute session examining formal verification (Lean), neuro-symbolic theorem proving, and where frontier mathematical discovery differs from contest benchmarks.
Search or browse every recorded session across courses and talks.
