The Harem Problem

Let B be a set of boys, and suppose that each boy in B wishes to marry more than one of his girl friends. Find a necessary and sufficient condition for the harem problem to have a solution.

I was thinking perhaps we need to somehow replace each boy by several identical copies of himself, and then try to use Hall's theorem. But how?