  We consider the stable assignment problem on a graph with nonnegative real
capacities on the edges and quotas on the vertices, in which the preferences of
agents are given via diversifying choice functions. We prove that for any input
of the problem, there exists exactly one stable assignment, and propose a
polynomial time algorithm to find it.
