I have a list of companies with n timeslots (number of slots may vary from company to company) and a list of students. Each student made a list of their top 3 companies they would like to talk to.

Is there an algorithm to efficiently match those students to timeslots, taking the student's preferences into consideration?

I already did some research, and I think I could find some answers in the field of Graph Theory, but I'm really new to this.

Your help would be really appreciated.

Thank you in advance.

I have a list of companies with n timeslots (number of slots may vary from company to company) and a list of students. Each student made a list of their top 3 companies they would like to talk to.

Is there an algorithm to efficiently match those students to timeslots, taking the student's preferences into account?

I already did some research, and I think I could find some answers in the field of Graph Theory, but I'm really new to this.

Your help would be really appreciated.

Thank you in advance.