The Stable Allocation (or Ordinal Transportation) Problem

DOI10.1287/moor.27.3.485.310zbMath1082.90508OpenAlexW2140642839MaRDI QIDQ5704093

Mourad Baïou

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.27.3.485.310

zbMATH Keywords

many-to-many matchingstable matchingstable allocationuniversity admissionsstable marriagestable assignmenttwo-sided marketordinal transportation

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Boolean programming (90C09) Matching models (91B68)

Related Items (20)

Student admissions and faculty recruitment ⋮ Improved algorithmic results for unsplittable stable allocation problems ⋮ David Gale in Paris ⋮ The object allocation problem with random priorities ⋮ Incentivizing resilience in financial networks ⋮ Review of the theory of stable matchings and contract systems ⋮ Choice functions on posets ⋮ Stable allocations and partially ordered sets ⋮ Stable schedule matching under revealed preference. ⋮ The integral stable allocation problem on graphs ⋮ Stable schedule matchings ⋮ Stable multicommodity flows ⋮ Stable flows over time ⋮ On stable matchings and flows ⋮ Characterizations of the optimal stable allocation mechanism ⋮ Fractional solutions for capacitated NTU-games, with applications to stable matchings ⋮ Equitable representation and recruitment ⋮ On Stable Matchings and Flows ⋮ The stable \(b\)-matching polytope revisited ⋮ Graphs of transportation polytopes

This page was built for publication: The Stable Allocation (or Ordinal Transportation) Problem