The Geometry of Fractional Stable Matchings and Its Applications

From MaRDI portal
Publication:2757570

DOI10.1287/moor.23.4.874zbMath0977.90046OpenAlexW2114200231MaRDI QIDQ2757570

Jay Sethuraman, Chung-Piaw Teo

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.4.874




Related Items (59)

Improving the Chilean College Admissions SystemSatisfied two-sided matching: a method considering elation and disappointment of agentsCharacterization of super-stable matchingsMedian stable matchings in two-sided marketsStable Marriage and Roommates Problems with Restricted Edges: Complexity and ApproximabilityBlockers and antiblockers of stable matchingsThe object allocation problem with random prioritiesQuasi-Popular Matchings, Optimality, and Extended FormulationsFinding a Level Ideal of a PosetPopular matchings in complete graphsStable matching with network externalitiesDisjoint stable matchings in linear timeOptimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special caseTwo problems in max-size popular matchingsThe vigilant eating rule: a general approach for probabilistic economic design with constraintsReview of the theory of stable matchings and contract systemsStable matching: An integer programming approachComputing relaxations for the three-dimensional stable matching problem with cyclic preferencesOn the set of stable matchings in a bipartite graphImplementation in undominated strategies with applications to auction design, public good provision and matchingStable allocations and partially ordered setsStable sharingPreferences and the price of stability in matching marketsLocally Stable Marriage with Strict PreferencesOn the stable \(b\)-matching polytope.Fair-by-design matchingUnderstanding the generalized median stable matchingsWhat price stability? Social welfare in matching marketsA unified approach to finding good stable matchings in the hospitals/residents settingThe stable roommates problem with short listsStable fractional matchingsCenter Stable Matchings and Centers of Cover Graphs of Distributive LatticesStable marriage and roommates problems with restricted edges: complexity and approximabilitySex-equal stable matchings: complexity and exact algorithmsA 25/17-approximation algorithm for the stable marriage problem with one-sided tiesMedian stable matching for markets with wagesCompromises and rewards: stable and non-manipulable probabilistic matchingDeferred acceptance is minimally manipulableMedian stable matching for college admissionsSmith and Rawls share a room: stability and mediansMatching with preferences over colleagues solves classical matchingOn the set of many-to-one strongly stable fractional matchingsThe college admissions problem with lower and common quotasUnnamed ItemTwo school systems, one district: what to do when a unified admissions process is impossibleEfficiency and stability of probabilistic assignments in marriage problemsThe Generalized Median Stable Matchings: Finding Them Is Not That EasyStability and median rationalizability for aggregate matchingsQuantile stable mechanismsThe Stable Roommates Problem with Short ListsPopular Matchings in Complete GraphsLattice structure of the random stable set in many-to-many matching marketsDeferred Acceptance with Compensation ChainsRandom matching under priorities: stability and no envy conceptsOn a cutting plane heuristic for the stable roommates problem and its applicationsPolyhedral Aspects of Stable MarriagePopularity, Mixed Matchings, and Self-DualityA polynomial-time algorithm for the bistable roommates problemUnderstanding Popular Matchings via Stable Matchings




This page was built for publication: The Geometry of Fractional Stable Matchings and Its Applications