34 min
Local Coordination and the Geometry of Social Networks
Game Theory, Geometry and seminar by Omer Tamuz, Caltech
Wednesday 10:00 Los Angeles (GMT-7)
Recording available
Berkeley, United States
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
Agentsnearby neighbourslocal coordinationnetwork regionsgeometric conditioncollective efficiencynetwork structurecorrelationsdynamic gamesoptimal collective efficiency