Stable-Marriage Problem applied to teacher-teaching assistant pairing.

Say you've got 83 teachers and 157 student teaching assistants.

Every application of the gale-shapley algorithm I find shows matching of even numbers.

Is there an implementation where there are uneven matching pairs? Or an implementation where it is unreasonable to ask someone to rank every student? For example, a teacher picks their favorite 10 kids, and they'll be assigned two of them. And a student picks their favorite five teachers?

I'm not looking for a coded solution -- just a direction to point my search.

Thanks.