Combinatorics of Equilibria in Game Theory
Institute for Pure & Applied Mathematics (IPAM) via YouTube
Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
Power BI Fundamentals - Create visualizations and dashboards from scratch
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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)