We view a game abstractly as a semiparametric mixture distribution and study the semiparametric efficiency bound of this model. Our results suggest that a key issue for inference is the number of equilibria compared to the number of outcomes. If the number of equilibria is sufficiently large compared to the number of outcomes, root-n consistent estimation of the model will not be possible. We also provide a simple estimator in the case when the efficiency bound is strictly above zero.