Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

The stable admissions polytope

  • Published:
Mathematical Programming Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: April 10, 1998 / Accepted: June 3, 1999¶Published online January 27, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baïou, M., Balinski, M. The stable admissions polytope. Math. Program. 87, 427–439 (2000). https://doi.org/10.1007/s101070050004

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050004

Navigation