Question
Q1. Matching in college admission Here is a matching problem between 5 students and 3 colleges. Colleges 1 and 2 each have 2 seats ,
Q1. Matching in college admission
Here is a matching problem between 5 students and 3 colleges. Colleges 1 and 2 each have 2 seats, and college 3 has 1 seat only. The following matrix describes the preferences of both sides. ("" means "unacceptable".)
(i) If we apply the student-proposing deferred acceptance (DA) algorithm, which students will college 2 admit?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Economic Change In Asia Implications For Corporate Strategy And Social Responsibility
Authors: M Bruna Zolin, Bernadette Andreosso O'Callaghan, Jacques Jaussaud
1st Edition
1317286650, 9781317286653
