34 min
Seminar, Hosted by Simons Institute for the Theory of Computing
Local Coordination and the Geometry of Social Networks
Caltech
- Game Theory, Geometry and
Recording
Abstract
Agents coordinating only with nearby neighbours may settle on different actions in different network regions. This talk identifies a geometric condition determining when such local coordination can approach optimal collective efficiency. Where the condition fails, network structure also limits correlations achievable across a broader class of dynamic games.
Topics
- Agents
- nearby neighbours, search World Wide
- local coordination, search World Wide
- network regions, search World Wide
- geometric condition, search World Wide
- collective efficiency, search World Wide
- network structure
- correlations
- dynamic games, search World Wide
- optimal collective efficiency, search World Wide