During the internship season m tech companies are looking to hire CS undergrads, each company has k number of available positions. There are also n CS undergrads, each interested in joining one of the companies. After all the interviews each company has rankings of students in order of preference, and each student has a ranking of companies in order of preference. We can assume that there are more internship slots available than the number of students. (This means that at the end not all slots will be filled.) Describe an algorithm that finds a stable assignment of students to companies. That is, each student will get assigned to one company and the resulting matching is stable. In your answer make sure to follow the guidelines of solving an algorithmic problem, as described above.

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter20: Queuing Theory
Section20.2: Modeling Arrival And Service Processes
Problem 3P
icon
Related questions
Question
During the internship season m tech companies are looking to hire CS undergrads, each company
has k number of available positions. There are also n CS undergrads, each interested in joining
one of the companies. After all the interviews each company has rankings of students in order of
preference, and each student has a ranking of companies in order of preference. We can assume
that there are more internship slots available than the number of students. (This means that at
the end not all slots will be filled.)
Describe an algorithm that finds a stable assignment of students to companies. That is, each
student will get assigned to one company and the resulting matching is stable.
In your answer make sure to follow the guidelines of solving an algorithmic problem, as described
above.
Transcribed Image Text:During the internship season m tech companies are looking to hire CS undergrads, each company has k number of available positions. There are also n CS undergrads, each interested in joining one of the companies. After all the interviews each company has rankings of students in order of preference, and each student has a ranking of companies in order of preference. We can assume that there are more internship slots available than the number of students. (This means that at the end not all slots will be filled.) Describe an algorithm that finds a stable assignment of students to companies. That is, each student will get assigned to one company and the resulting matching is stable. In your answer make sure to follow the guidelines of solving an algorithmic problem, as described above.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Constraint Satisfaction Problems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
A Guide to SQL
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr