SOCIAL INTERACTIONS IN LARGE NETWORKS: A GAME THEORETIC APPROACH

Abstract

Abstract This article studies estimation of social interactions in a large network game, where all observations come from one single equilibrium of a network game with asymmetric information. Simple assumptions about the structure are made to establish the existence and uniqueness of the equilibrium. I show that the equilibrium strategies satisfy a network decaying dependence condition requiring that dependence between two players' decisions decay with their network distance, which serves as the basis for my statistical inference. Moreover, I establish identification and propose a computationally feasible and efficient estimation method, which is illustrated by an empirical application of college attendance.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 41 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.