Let G be a bipartite graph with vertex classes X and Y , where X is a set of co-op students and Y is the set of jobs to which they can apply. The edge set is the set of all pairs xy where x applied to y. Suppose that each employer wishes to assemble a team of up to 4 students to work on each job. Each student ranks the jobs he/she applies to in order of preference, and each employer ranks all students who applied to that job in order of preference. We say that an assignment of at most 4 students to each job (and at most one job to each student) is stable if for every student x and job y, if x applied to y then one of the following holds: (i) x was assigned to the team doing job y, (ii) x was assigned a job he/she prefers to y, or (iii) there were exactly 4 students assigned to the team doing job y, all of which are preferred by the employer to x. Give an efficient algorithm that finds a stable job assignment for every instance of this problem, and