Combinatorics of Equilibria in Game Theory
Institute for Pure & Applied Mathematics (IPAM) via YouTube
Launch a New Career with Certificates from Google, IBM & Microsoft
Earn Your Business Degree, Tuition-Free, 100% Online!
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a research lecture from the Max-Planck Institute's Irem Portakal examining Nash and correlated equilibria through the lens of nonlinear algebra and convex geometry. Delve into the mathematical analysis of correlated equilibria as convex polytopes within probability simplex, with particular focus on combinatorial types in small games. Presented at UCLA's Institute for Pure & Applied Mathematics workshop on Computational Interactions between Algebra, Combinatorics, and Discrete Geometry, this 41-minute talk showcases collaborative research with Benjamin Hollering and Marie-Charlotte Brandenburg that bridges game theory, economics, and advanced mathematical frameworks while highlighting promising future research directions in the field.
Syllabus
Irem Portakal - Combinatorics of equilibria in game theory - IPAM at UCLA
Taught by
Institute for Pure & Applied Mathematics (IPAM)