| Article ID: | iaor20013606 |
| Country: | Germany |
| Volume: | 87 |
| Issue: | 3 |
| Start Page Number: | 427 |
| End Page Number: | 439 |
| Publication Date: | Jan 2000 |
| Journal: | Mathematical Programming |
| Authors: | Baou Mourad, Balinski Michel |
| Keywords: | education |
The stable admissions polytope – the convex hull of the stable assignments of the university admissions problem – is described by a set of linear inequalities. It depends on a new characterization of stability and arguments that exploit and extend a graphical approach that has been fruitful in the analysis of the stable marriage problem.