We develop an asymptotic theory for static discrete-action games with a large number of players, and propose a novel inference approach based on stochastic expansions around the limit of the finite-player game. Our analysis focuses on anonymous games in which payoffs are a function of the agent's own action and the empirical distribution of her opponents' play. We establish a law of large numbers and central limit theorem which can be used to establish consistency of point or set estimators and asymptotic validity for inference on structural parameters as the number of players increases. The proposed methods as well as the limit theory are conditional on the realized equilibrium in the observed sample and therefore do not require any assumptions regarding selection among multiple equilibria.

We propose a bootstrap procedure for data that may exhibit cluster‐dependence in two or more dimensions. The asymptotic distribution of the sample mean or other statistics may be non‐Gaussian if observations are dependent but uncorrelated within clusters. We show that there exists no procedure for estimating the limiting distribution of the sample mean under two‐way clustering that achieves uniform consistency. However, we propose bootstrap procedures that achieve adaptivity with respect to different uniformity criteria. Important cases and extensions discussed in the paper include regression inference, U‐ and V‐statistics, subgraph counts for network data, and non‐exhaustive samples of matched data.

This paper studies two-sided matching markets with non-transferable utility when the number of market participants grows large. We consider a model in which each agent has a random preference ordering over individual potential matching partners, and agents' types are only partially observed by the econometrician. We show that in a large market, the inclusive value is a sufficient statistic for an agent's endogenous choice set with respect to the probability of being matched to a spouse of a given observable type. Furthermore, while the number of pairwise stable matchings for a typical realization of random utilities grows at a fast rate as the number of market participants increases, the inclusive values resulting from any stable matching converge to a unique deterministic limit. We can therefore characterize the limiting distribution of the matching market as the unique solution to a fixed-point condition on the inclusive values. Finally we analyze identification and estimation of payoff parameters from the asymptotic distribution of observable characteristics at the level of pairs resulting from a stable matching.