Identification and Estimation of Large Network Games with Private Link Information
Hülya Eraslan & Xun Tang
What the paper says
We study the identification and estimation of large network games in which individuals choose continuous actions while holding private information about their links and payoffs. Extending the framework of Galeotti et al., we build a tractable empirical model of such network games and show that the parameters in individual payoffs are identified under large‐market asymptotics in which the number of individuals increases to infinity on a single large network. We then propose a semiparametric two‐step M‐estimator for these individual payoffs and demonstrate its good finite‐sample performance in simulations.
5 citations
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.41 × 0.4 = 0.16 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.