A further note on the college admission game (Q662278): Difference between revisions

Two finite and disjoint sets of colleges and students are considered. A linear order of colleges can be a preference of a student, but a linear order of students can be a preference for a college. \textit{The college admission game } will be played when each student and each college choose their preferences. The outcome is the allocation of students to colleges, determined by a predetermined algorithm. The author discusses additional assumptions and restrictions, as well as the necessary concepts, that customize the game to real market rules. The results are reported as filling gaps in the theory of incentives for the game. These are presented in the form of theorems which are typically named: General manipulability Theorem, General Impossibility Theorem, Characterization of the Nash equilibrium outcomes and Stability of the equilibrium outcomes.