Stable fractional matchings
From MaRDI portal
Recommendations
Cites work
- ``Almost-stable matchings in the hospitals/residents problem with couples
- A Constraint Programming Approach to the Hospitals / Residents Problem
- A new fixed point approach for stable networks and stable marriages
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- An efficient algorithm for the “stable roommates” problem
- Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
- Characterization of stable matchings as extreme points of a polytope
- Clearinghouses for two-sided matching: an experimental study
- College Admissions and the Stability of Marriage
- Complexity of the sex-equal stable marriage problem
- Compromises and rewards: stable and non-manipulable probabilistic matching
- Efficiency and stability of probabilistic assignments in marriage problems
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- Hard variants of stable marriage.
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- scientific article; zbMATH DE number 2084708 (Why is no real title available?)
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- Integer programming methods for special college admissions problems
- Kidney Exchange
- Linear programming brings marital bliss
- Mathematical models for stable matching problems with ties and incomplete lists
- Multilateral matching
- On a lemma of Scarf.
- Ordinal and cardinal solution concepts for two-sided matching
- Random Matching Under Dichotomous Preferences
- Random matching under priorities: stability and no envy concepts
- Stability, optimality and manipulation in matching problems with weighted preferences
- Stable marriage with ties and bounded length preference lists
- Stable Matchings, Optimal Assignments, and Linear Programming
- Strategy-proof school choice mechanisms with minimum quotas and initial endowments
- Strategyproof matching with regional minimum and maximum quotas
- Term Rewriting and Applications
- The geometry of fractional stable matchings and its applications
- The Maximum-Weight Stable Matching Problem: Duality and Efficiency
- Three Fast Algorithms for Four Problems in Stable Marriage
Cited in
(6)- On the use of optimal fractional matchings for solving the (integer) matching problem
- A characterization of strongly stable fractional matchings
- On the complexity of stable fractional hypergraph matching
- Fractional matching markets
- Ex-post stability under two-sided matching: complexity and characterization
- On certain classes of fractional matchings
This page was built for publication: Stable fractional matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238635)