Erratum: The Stable Allocation (or Ordinal Transportation) Problem

DOI10.1287/moor.27.4.662.302zbMath1083.90501OpenAlexW1987825067WikidataQ60174227 ScholiaQ60174227MaRDI QIDQ5704102

Michel Balinski, 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.4.662.302

Mathematics Subject Classification ID

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

Related Items (18)

A coloring property for stable allocations ⋮ David Gale in Paris ⋮ Finding a Stable Allocation in Polymatroid Intersection ⋮ On stable flows and preflows ⋮ On the set of stable matchings in a bipartite graph ⋮ Marital preferences and stable matching in cultural evolution ⋮ A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas ⋮ Faster algorithms for stable allocation problems ⋮ Fractional matching markets ⋮ A direct barter model for course add/drop process ⋮ Applications of discrete convex analysis to mathematical economics ⋮ A general two-sided matching market with discrete concave utility functions ⋮ The Generalized Stable Allocation Problem ⋮ Representation of lattices via set-colored posets ⋮ The diameter of the stable marriage polytope: bounding from below ⋮ Truthful Generalized Assignments via Stable Matching ⋮ Paths to stable allocations ⋮ On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market

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