Learn about the application of game theory to computational social science in this recorded seminar lecture from the prestigious Kolmogorov series on computational complexity. Explore key concepts including monoculture social welfare, algorithmic ranking, and the Price Paradox through an in-depth discussion of published research. Examine critical assumptions, permutations, optimality conditions, and preference structures that shape how game theory interfaces with social computational systems. Follow along as the speaker breaks down complex theoretical frameworks into digestible components, providing intuitive explanations of how these mathematical principles apply to real-world social science scenarios. Gain insights from this academic presentation that bridges pure theory with practical applications in the growing field of computational social science.
Overview
Syllabus
Intro
What is monoculture social welfare
Algorithmic ranking
Assumptions
Permutations
Optimality
Paradox
Evaluation
Price Paradox
Preference
Intuition
Taught by
Kolmogorov-Seminar