Abraham et al. [1]} described a linear-time algorithm to find a stable matching in an instance \(I\)  of spa-s when all preference lists in \(I\)  are strictly ordered. They also showed that, under this condition, all stable matchings in \(I\)  are of the same size. In this paper we focus on the variant of spa-s in which preference lists of students and lecturers can contain ties, which we refer to as the spa-st (spa-st). Ties allow both students and lecturers to express indifference in their preference lists (in practice, for example, lecturers may be unable to distinguish between certain groups of students). A stable matching in an instance of spa-st can be found in linear time by breaking the ties arbitrarily and using the algorithm of Abraham et al. [1]}.
