The Generalized Stable Allocation Problem

DOI10.1007/978-3-642-00202-1_21zbMath1211.68283OpenAlexW1531677592MaRDI QIDQ3605501

Namrata Swar, Brian C. Dean

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_21

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Fractional solutions for capacitated NTU-games, with applications to stable matchings

Cites Work

• Unnamed Item
• A data structure for dynamic trees
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• Self-adjusting binary search trees
• Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
• Erratum: The Stable Allocation (or Ordinal Transportation) Problem
• College Admissions and the Stability of Marriage

This page was built for publication: The Generalized Stable Allocation Problem