The Generalized Stable Allocation Problem

DOI10.1007/978-3-642-00202-1_21MaRDI QIDQ3605501zbMATH OpenOpenAlexFDO

Authors Brian C. Dean, Namrata Swar

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

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

Recommendations

• The Stable Allocation (or Ordinal Transportation) Problem
• Faster algorithms for stable allocation problems
• The integral stable allocation problem on graphs
• Strongly stable assignment
• scientific article; zbMATH DE number 4133845

Cites work

• A data structure for dynamic trees
• College Admissions and the Stability of Marriage
• Erratum: The Stable Allocation (or Ordinal Transportation) Problem
• Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• Self-adjusting binary search trees

Cited in

(14)

• Fractional solutions for capacitated NTU-games, with applications to stable matchings
• The integral stable allocation problem on graphs
• Faster algorithms for stable allocation problems
• Characterizations of the optimal stable allocation mechanism
• A coloring property for stable allocations
• scientific article; zbMATH DE number 6481543 (Why is no real title available?)
• scientific article; zbMATH DE number 4133845 (Why is no real title available?)
• Improved algorithmic results for unsplittable stable allocation problems
• Strongly stable assignment
• On a new algorithm for stable assignment^*
• An Exact Analysis of Stable Allocation
• Truthful generalized assignments via stable matching
• The Stable Allocation (or Ordinal Transportation) Problem
• On stable assignments generated by choice functions of mixed type

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

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