Skip to content
Open access

An optimal test for strategic interaction in network formation games

Aug 2026 · The Review of Economic Studies · 0 citations

TL;DR

The random utility specification induces an exponential family structure under the null which is exploited to construct a similar test which exactly controls size (despite the the null being a composite one with many nuisance parameters).

Abstract

Consider a setting where N players, partitioned into K observable types, form a directed network. Agents’ preferences over the form of the network consist of an arbitrary network benefit function (e.g., agents may have preferences over their network centrality) and a private, or dyadic, component which is additively separable in own links. This latter component allows for unobserved heterogeneity in the costs of sending and receiving links across agents (respectively out- and in- degree heterogeneity) as well as homophily/heterophily across the K types of agents. In contrast, the network benefit function allows agents’ preferences over links to vary with the presence or absence of links elsewhere in the network (and hence with the link formation behavior of their peers). In the null model, which excludes the network benefit function, links form independently across dyads in the manner described by Charbonneau (2017) among others. Under the alternative, there is interdependence across linking decisions (i.e., strategic interaction). We show how to test the null with power optimized in specific directions. These alternative directions include many common models of strategic network formation (e.g., “connections” models, “structural hole” models etc.). Our random utility specification induces an exponential family structure under the null which we exploit to construct a similar test which exactly controls size (despite the the null being a composite one with many nuisance parameters). We further show how to construct locally best tests for specific alternatives without making any assumptions about equilibrium selection. To make our tests feasible, we introduce a new MCMC algorithm for simulating the null distributions of our test statistics.

Read PDF

Similar papers

Preprint Oct 2026

Network Intervention by Polling Strategic Agents

A planner in a network of strategic agents faces three entangled challenges: the optimum depends on agents'private information, queried agents may misreport to steer the outcome, and exact computation does not scale. We study these challenges in multi-activity network games with heterogeneous private technologies, in w...

Chenyu Zhang, R. Parasnis, Saurabh Amin · 0 citations

Working papers series

Dunia López-Pintado · 0 citations
Preprint Sep 2026

Strategic Centrality and the Emergence of Core-Periphery Networks

We study a network formation game in which agents sponsor links at a linear cost in order to maximize centrality, defined as a weighted sum of walk counts with positive and weakly decreasing weights. This class includes Katz Bonacich centrality and total communicability and captures environments in which access decays...

Itai Arieli, João Correia-da-Silva, Wade Hann-Caruthers et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.