skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Experimentation in Networks
We propose a model of strategic experimentation on social networks in which 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’ asymptotic learning is perfect. By contrast, agent welfare is single peaked in network density and achieves a second-best benchmark level at intermediate levels that strike a balance between discovery and diffusion. (JEL D82, D83, D86, O31, O33, Z13)  more » « less
Award ID(s):
2149291
PAR ID:
10624052
Author(s) / Creator(s):
;
Publisher / Repository:
American Economic Review
Date Published:
Journal Name:
American Economic Review
Volume:
114
Issue:
9
ISSN:
0002-8282
Page Range / eLocation ID:
2940 to 2980
Subject(s) / Keyword(s):
Networks, Experimentation, Diffusion
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Sequential learning models situations where agents predict a ground truth in sequence, by using their private, noisy measurements, and the predictions of agents who came earlier in the sequence. We study sequential learning in a social network, where agents only see the actions of the previous agents in their own neighborhood. The fraction of agents who predict the ground truth correctly depends heavily on both the network topology and the ordering in which the predictions are made. A natural question is to find an ordering, with a given network, to maximize the (expected) number of agents who predict the ground truth correctly. In this paper, we show that it is in fact NP-hard to answer this question for a general network, with both the Bayesian learning model and a simple majority rule model. Finally, we show that even approximating the answer is hard. 
    more » « less
  2. Under the designation “platform urbanism,” there is growing scholarly recognition that platform intermediaries are reconfiguring urban industries, processes, and relationships through the collection and manipulation of big data. Central to realizing this economic project is financial speculation on platforms’ ability to coordinate network effects—a phenomenon in which the more users there are in a networked system, the more valuable and useful it becomes. In this paper, I argue that while the existing literature recognizes the importance of network effects, it has also adopted a limited conceptualization that understands platform firms as the primary agents generating and capturing the economic benefits of network effects. Drawing on 12 months of ethnographic fieldwork in Greater Jakarta, Indonesia, I work to expand this understanding through attention to the social lives of network effects—the ways in which platform architectures are always embedded in social relations created and sustained in everyday urban life. I show how ride-hailing drivers have attempted to mitigate the risks of their work through building socio-technical networks of their own, for their own purposes. Doing so reveals that it is not only platform firms and venture capital that speculate on network effects; rather, a range of actors in the city-region seek to tap into driver networks to advance their own social, political, and economic ends. In conclusion, I suggest that attending to these practices opens up space to reframe platform urbanism beyond its current preoccupation with macro political economic analyses, while also establishing new lines of inquiry for “speculative urbanism.” 
    more » « less
  3. Cremonini, Marco (Ed.)
    Understanding the spread of false or dangerous beliefs—often called misinformation or disinformation—through a population has never seemed so urgent. Network science researchers have often taken a page from epidemiologists, and modeled the spread of false beliefs as similar to how a disease spreads through a social network. However, absent from those disease-inspired models is an internal model of an individual’s set of current beliefs, where cognitive science has increasingly documented how the interaction between mental models and incoming messages seems to be crucially important for their adoption or rejection. Some computational social science modelers analyze agent-based models where individuals do have simulated cognition, but they often lack the strengths of network science, namely in empirically-driven network structures. We introduce a cognitive cascade model that combines a network science belief cascade approach with an internal cognitive model of the individual agents as in opinion diffusion models as a public opinion diffusion (POD) model, adding media institutions as agents which begin opinion cascades. We show that the model, even with a very simplistic belief function to capture cognitive effects cited in disinformation study (dissonance and exposure), adds expressive power over existing cascade models. We conduct an analysis of the cognitive cascade model with our simple cognitive function across various graph topologies and institutional messaging patterns. We argue from our results that population-level aggregate outcomes of the model qualitatively match what has been reported in COVID-related public opinion polls, and that the model dynamics lend insights as to how to address the spread of problematic beliefs. The overall model sets up a framework with which social science misinformation researchers and computational opinion diffusion modelers can join forces to understand, and hopefully learn how to best counter, the spread of disinformation and “alternative facts.” 
    more » « less
  4. Federated Learning (FL) trains a shared model using data and computation power on distributed agents coordinated by a central server. Decentralized FL (DFL) utilizes local model exchange and aggregation between agents to reduce the communication and computation overheads on the central server. However, when agents are mobile, the communication opportunity between agents can be sporadic, largely hindering the convergence and accuracy of DFL. In this paper, we propose Cached Decentralized Federated Learning (Cached-DFL) to investigate delay-tolerant model spreading and aggregation enabled by model caching on mobile agents. Each agent stores not only its own model, but also models of agents encountered in the recent past. When two agents meet, they exchange their own models as well as the cached models. Local model aggregation utilizes all models stored in the cache. We theoretically analyze the convergence of Cached-DFL,explicitly taking into account the model staleness introduced by caching. We design and compare different model caching algorithms for different DFL and mobility scenarios. We conduct detailed case studies in a vehicular network to systematically investigate the interplay between agent mobility, cache staleness, and model convergence. In our experiments, Cached-DFL converges quickly, and significantly outperforms DFL without caching. 
    more » « less
  5. Regardless of how much data artificial intelligence agents have available, agents will inevitably encounter previously unseen situations in real-world deployments. Reacting to novel situations by acquiring new information from other people—socially situated learning—is a core faculty of human development. Unfortunately, socially situated learning remains an open challenge for artificial intelligence agents because they must learn how to interact with people to seek out the information that they lack. In this article, we formalize the task of socially situated artificial intelligence—agents that seek out new information through social interactions with people—as a reinforcement learning problem where the agent learns to identify meaningful and informative questions via rewards observed through social interaction. We manifest our framework as an interactive agent that learns how to ask natural language questions about photos as it broadens its visual intelligence on a large photo-sharing social network. Unlike active-learning methods, which implicitly assume that humans are oracles willing to answer any question, our agent adapts its behavior based on observed norms of which questions people are or are not interested to answer. Through an 8-mo deployment where our agent interacted with 236,000 social media users, our agent improved its performance at recognizing new visual information by 112%. A controlled field experiment confirmed that our agent outperformed an active-learning baseline by 25.6%. This work advances opportunities for continuously improving artificial intelligence (AI) agents that better respect norms in open social environments. 
    more » « less