The general assignment problem requires assigning d agents to d 0 tasks such that the agent nodes and the task nodes form a bipartite graph (without loss of generality, assume d  d 0 ).
an agent can handle exactly one task, and each task can only be handled by at most one agent.