In this paper, an application of evolutionary game dynamics is proposed in order to profit from the desirable features of mixed strategist dynamics in the solution of distributed resource allocation problems. The key idea of this approach is to define mixed strategies that represent the vertices of the convex hull of the set of feasible solutions defined by the constraints of the local optimization problems. With this approach, the dynamics of the state vector is restricted to a subset of the simplex. Details of the defintion of appropriate mixed strategies, payoff functions, and the multi-population modeling followed for this problem are provided.