Analysis of completeness of laboratory assignment algorithm by abstract reduction systems theory

A laboratory assignment algorithm is a procedure that assigns each of the m students to one of the n laboratories. In this paper, we prove the completeness (i.e., termination and confluence) of the algorithm by using the abstract reduction systems theory. Termination guarantees that the computation will not proceed indefinitely, and confluence guarantees that the computational result is unique even in the presence of indeterminacy.