CALENDRIER

septembre 2018
L M M J V S D
          01 02
03 04 05 06 07 08 09
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30

Partager cet événement

Enregistrer cet événement

Séminaire du GERAD : A theory of non-Bayesian social learning

Date
Lundi 15 janvier 2018
Débute à 14:00

Prix
gratuit

Contact
Marilyne Lavoie
Site Web

Lieu
4488
2920, chemin de la Tour
Montréal, QC Canada
H3T 1N8

514 343-6111
Site Web | Itinéraire et carte

Catégories


Consulté 349 fois
Séminaire du GERAD :  A theory of non-Bayesian social learning

Titre :  A theory of non-Bayesian social learning

Conférencier : Ali Jadbabaie – MIT, États-Unis

In this talk we will investigate the behavioral foundations of non-Bayesian models of learning over social networks and present a taxonomy of conditions for information aggregation in a general framework. As our main behavioral assumption, we postulate that agents follow social learning rules that satisfy “imperfect recall,” according to which they treat the current beliefs of their neighbors as sufficient statistics for the entire history of their observations. We augment this assumption with various restrictions on how agents process the information provided by their neighbors and obtain representation theorems for the corresponding learning rules (including the canonical model of DeGroot). We then obtain general long-run learning results that are not tied to the learning rules’ specific functional forms, thus identifying the fundamental forces that lead to learning, non-learning, and mislearning in social networks. Our results illustrate that, in the presence of imperfect recall, long-run aggregation of information is closely linked to (i) the rate at which agents discount their neighbors’ information over time, (ii) the curvature of agents’ social learning rules, and (iii) whether their initial tendencies are amplified or moderated as a result of social interactions. We also investigate the rate of information aggregation and show that it is a function of the centrality of agents and the informativeness of the observations. If time permits, we will also investigate the computations that fully Bayesian agents need to undertake in Bayesian social learning and show that computing the posterior belief is general NP Hard.

Joint work with Pooya Molavi (MIT Economics), Alireza Tahbaz-Salehi (Northwestern Kellogg), and Amin Rahimian (MIT IDSS).

Relevant paper: A Theory of Non-Bayesian Social Learning, forthcoming, Econometrica

---

Entrée gratuite. Bienvenue à tous!

© École Polytechnique de Montréal
Bottin | Plan du site | Recherche | Conditions | Besoin d'aide?