Linear programming brings marital bliss
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- scientific article; zbMATH DE number 4027472 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3558960 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- College Admissions and the Stability of Marriage
- Every finite distributive lattice is a set of stable matchings
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- Stable matching with preferences derived from a psychological model
- The Complexity of Counting Stable Marriages
Cited in
(62)- Improving solution times for stable matching problems through preprocessing
- The diameter of the stable marriage polytope: bounding from below
- Quasi-popular matchings, optimality, and extended formulations
- Stable multi-skill workforce assignments
- On a cutting plane heuristic for the stable roommates problem and its applications
- Characterization of stable matchings as extreme points of a polytope
- Characterization of super-stable matchings
- Understanding popular matchings via stable matchings
- An extendable stable matching algorithm of a kind of bipartite graph
- On the set of stable matchings in a bipartite graph
- Satisfied two-sided matching: a method considering elation and disappointment of agents
- Optimizing the marriage market: an application of the linear assignment model
- Stable allocations and partially ordered sets
- Equivalence of two-sided stable matching
- Review of the theory of stable matchings and contract systems
- Polyhedral aspects of stable marriage
- Marriage market with indifferences: a linear programming approach
- Stable matchings and linear inequalities
- A note on the lattice structure for matching markets via linear programming
- The object allocation problem with random priorities
- Mathematical models for stable matching problems with ties and incomplete lists
- A polynomial-time algorithm for the bistable roommates problem
- Stable marriages and search frictions
- Existence of stable outcomes and the lattice property for a unified matching market
- Bistable versions of the marriages and roommates problems
- A characterization of strongly stable fractional matchings
- Random matching under priorities: stability and no envy concepts
- Maximum stable matching with one-sided ties of bounded length
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- Compromises and rewards: stable and non-manipulable probabilistic matching
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- Affinely representable lattices, stable matchings, and choice functions
- A matroid approach to stable matchings with lower quotas
- An elementary integrality proof of Rothblum's stable matching formulation
- Popularity, Mixed Matchings, and Self-Duality
- The rank pricing problem with ties
- Bargaining and Competition in Matching Markets
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- Efficiency and stability of probabilistic assignments in marriage problems
- On the stable \(b\)-matching polytope.
- Canonical monotone decompositions of fractional stable matchings
- Counting vertices of integral polytopes defined by facets
- Blockers and antiblockers of stable matchings
- Bipartite choices
- Stable Matchings, Optimal Assignments, and Linear Programming
- Stable marriage with general preferences
- On the stable marriage polytope
- Stable fractional matchings
- The stable tournament problem: matching sports schedules with preferences
- Complexity of the sex-equal stable marriage problem
- Equitable representation and recruitment
- scientific article; zbMATH DE number 7561396 (Why is no real title available?)
- Stable matchings and linear programming
- Task assignment with controlled and autonomous agents
- A matroid approach to stable matchings with lower quotas
- Courtship and linear programming
- Maximum matchings and popularity
- Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach
- Stable matching: An integer programming approach
- On stable assignments generated by choice functions of mixed type
- Online 2-stage stable matching
- Affinely representable lattices, stable matchings, and choice functions
This page was built for publication: Linear programming brings marital bliss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122480)
