Counterfactual policy evaluation often requires computation of game‐theoretic equilibria. We provide new algorithms for computing pure‐strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that...

Counterfactual policy evaluation often requires computation of game-theoretic equilibria. We provide new algorithms for computing pure-strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that a...

Counterfactual policy evaluation often requires computation of game‐theoretic equilibria. We provide new algorithms for computing pure‐strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that...

We model network formation as a simultaneous game of incomplete information, allowing linking decisions to depend on the structure of the network as well as the attributes of agents. When the data is rationalized by a symmetric equilibrium, meaning observationally equivalent agents choose the...