The stable allocation (or ordinal transportation) problem

Mathematics of Operations Research

Volumn 27, Issue 3, 2002, Pages 485-503

  Baïou, Mourad ^a,b   Balinski, Michel ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

Many to many matching; Ordinal transportation; Stable allocation; Stable assignment; Stable marriage; Stable matching; Two sided market; University admissions

Indexed keywords

ALGORITHMS; DATA REDUCTION; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DISTRIBUTIVE LATTICES; STABLE ALLOCATION PROBLEMS;

OPERATIONS RESEARCH;

EID: 0036670654     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.3.485.310     Document Type: Article

References (10)

1. Many-to-many matching: Stable polyandrous polygamy (or polygamous polyandry)
2. The stable admissions polytope
3. Of stable marriages and graphs, and strategy and polytopes
4. Graphs and marriages
5. A tale of two mechanisms: Student placement
6. College admissions and the stability of marriage