In this paper we study a two agents asymmetric stag hunt game. The model has an infinity of strict, Pareto rankable Nash equilibria. The equilibrium selection problem is solved by appealing to the stochastic stability concept put forward by Young (1993). We prove two main results. When the action sets are numerable in.nite sets, then for any value of the distributive parameter we can expect the emergence of a norm involving less than maximal cooperation. When instead the action sets are finite sets of a particular type (in the sense that each agent can choose his maximum optimal effort and fractions of this), then for some value of the distributive parameter we can expect the emergence of a norm involving maximal cooperation.