Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2-player non-zero-sum strategic games, whose Nash equilibria are only mixed.

We study the identification and estimation of large network games where each individual holds private information about its links and payoffs. Extending Galeotti, Goyal, Jackson, Vega-Redondo and Yariv (2010), we build a tractable empirical model of network games where the individuals are...