The coalitional Nash bargaining solution is defined to be the core allocation for which the product of players' payoffs is maximal. We consider a non‐cooperative model with discounting in which one team may form and every player is randomly selected to make a proposal in every period. The grand team, consisting of all players, generates the largest surplus. But a smaller team may form. We show that as players get more patient if an efficient and stationary equilibrium exists, it must deliver payoffs that correspond to the coalitional Nash bargaining solution. We also characterize when an efficient and stationary equilibrium exists, which requires conditions that go beyond the nonemptiness of the core.