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...

The symmetric two-player Hirshleifer (1989) contest is shown to admit a unique equilibrium. The support of the equilibrium strategy is finite and includes, in particular, the zero expenditure level. We also establish a lower bound for the cardinality of the support and an upper bound for the...