Experimentation on Networks

          @misc{ scivideos_23043,
            doi = {},
            url = {https://old.simons.berkeley.edu/talks/experimentation-networks},
            author = {},
            keywords = {},
            language = {en},
            title = {Experimentation on Networks},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2022},
            month = {dec},
            note = {23043 see, \url{https://scivideos.org/index.php/simons-institute/23043}}
          }
          

Abstract

We introduce a model of strategic experimentation on social networks where forward-looking agents learn from their own and neighbors’ successes. In equilibrium, private discovery is followed by social diffusion. Social learning crowds out own experimentation, so total information decreases with network density; we determine density thresholds below which agents asymptotically learn the state. In contrast, agent welfare is single-peaked in network density, and achieves a second-best benchmark level at intermediate levels that achieve a balance between discovery and diffusion. We also study how learning and welfare differ across directed, undirected and clustered networks.