In this note, we consider a broad class of network models where a large number of heterogeneous agents simultaneously interact in many ways. We provide an iterative algorithm for calculating an equilibrium and offer sufficient and "globally necessary" conditions under which the equilibrium is...

A menu description presents a mechanism to player i in two steps. Step (1) uses the reports of other players to describe i's menu: the set of i's potential outcomes. Step (2) uses i's report to select i's favorite outcome from her menu. Can menu descriptions better expose strategyproofness,...

This paper introduces a simulation algorithm for evaluating the log-likelihood function of a large supermodular binary-action game. Covered examples include (certain types of) peer effect, technology adoption, strategic network formation, and multi-market entry games. More generally, the...