We consider a variation of the maximum bipartite matching problem where each completed task must have at least two agents assigned to it. We give an integer programming formulation for the problem, and prove that the basic solutions of LP-relaxation are half-integral. It is shown that a fractional basic solution can be further processed to obtain an optimal solution to the problem.
 Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T. and Laskar, R. (2005) Generalized Subgraph-Restricted Matchings in Graphs. Discrete Mathematics, 293, 129-138. http://dx.doi.org/10.1016/j.disc.2004.08.027
 Aora, S. and Puri, M.C. (1998) A Variant of Time Minimizing Assignment Problem. European Journal of Operational Research, 110, 314-325. http://dx.doi.org/10.1016/S0377-2217(97)00266-X
 Chang, G.H. and Ho, P.-H. (1998) The b-Assignment Problem. European Journal of Operational Research, 104, 593-600. http://dx.doi.org/10.1016/S0377-2217(97)00008-8