Published July 11, 2022 | Version Published + Submitted
Book Section - Chapter Open

Learning in Repeated Interactions on Networks

  • 1. ROR icon California Institute of Technology
  • 2. ROR icon Yale University

Abstract

We study how long-lived, rational, exponentially discounting agents learn in a social network. In every period, each agent observes the past actions of his neighbors, receives a private signal, and chooses an action with the objective of matching the state. Since agents behave strategically, and since their actions depend on higher order beliefs, it is difficult to characterize equilibrium behavior. Nevertheless, we show that regardless of the size and shape of the network, and the patience of the agents, the equilibrium speed of learning is bounded from above by a constant that only depends on the private signal distribution.

Additional Information

© 2022 Copyright held by the owner/author(s). Philipp Strack was supported by a Sloan fellowship. Omer Tamuz was supported by a grant from the Simons Foundation (#419427), a Sloan fellowship, a BSF award (#2018397) and a National Science Foundation CAREER award (DMS-1944153).

Attached Files

Published - 3490486.3538307.pdf

Submitted - 2112.14265.pdf

Files

2112.14265.pdf

Files (1.5 MB)

Name Size
md5:045ef7e5ebdefe3743934b06d214fa70
276.2 kB Preview Download
md5:8d19726c5da301c4f9f2887f85af6996
1.2 MB Preview Download

Additional details

Identifiers

Eprint ID
115371
Resolver ID
CaltechAUTHORS:20220707-170550926

Related works

Funding

Alfred P. Sloan Foundation
Simons Foundation
419427
Binational Science Foundation (USA-Israel)
2018397
NSF
DMS-1944153

Dates

Created
2022-07-07
Created from EPrint's datestamp field
Updated
2022-07-27
Created from EPrint's last_modified field

Caltech Custom Metadata

Caltech groups
Mathematics Department