Erratum: The Stable Allocation (or Ordinal Transportation) Problem

DOI10.1287/MOOR.27.4.662.302MaRDI QIDQ5704102zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mourad Baïou, Michel Balinski

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)

Cited in

(19)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704102)