The Generalized Stable Allocation Problem
From MaRDI portal
Permutations, words, matrices (05A05) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 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
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Self-adjusting binary search trees
Cited in
(13)- Characterizations of the optimal stable allocation mechanism
- A coloring property for stable allocations
- An Exact Analysis of Stable Allocation
- Truthful generalized assignments via stable matching
- The integral stable allocation problem on graphs
- On stable assignments generated by choice functions of mixed type
- Improved algorithmic results for unsplittable stable allocation problems
- The Stable Allocation (or Ordinal Transportation) Problem
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- scientific article; zbMATH DE number 6481543 (Why is no real title available?)
- Strongly stable assignment
- Faster algorithms for stable allocation problems
- scientific article; zbMATH DE number 4133845 (Why is no real title available?)
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)