Stable Matchings, Optimal Assignments, and Linear Programming

Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Stochastic games, stochastic differential games (91A15) Other game-theoretic models (91A40) Discrete location and assignment (90B80) Matching models (91B68)

Recommendations

Stable matchings and linear programming
Linear programming brings marital bliss
On the stable marriage polytope
Of Stable Marriages and Graphs, and Strategy and Polytopes
Stable matchings and linear inequalities

Cited in

(74)

Too good to fire: non-assortative matching to play a dynamic game
Efficiency and stability of probabilistic assignments in marriage problems
Stable marriages and search frictions
Stable matching of student-groups to dormitories
Characterizations of the optimal stable allocation mechanism
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
On a cutting plane heuristic for the stable roommates problem and its applications
On the efficiency and fairness of deferred acceptance with single tie-breaking
On the set of stable matchings in a bipartite graph
Pairwise kidney exchange
Polynomial time algorithm for an optimal stable assignment with multiple partners
The Maximum-Weight Stable Matching Problem: Duality and Efficiency
On stable matchings and flows
Stable fractional matchings
Stable Matching with Uncertain Linear Preferences
A characterization of strongly stable fractional matchings
A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
scientific article; zbMATH DE number 7561396 (Why is no real title available?)
The price of matching with metric preferences
Lattice structure of the random stable set in many-to-many matching markets
Compromises and rewards: stable and non-manipulable probabilistic matching
Satisfied two-sided matching: a method considering elation and disappointment of agents
On the set of many-to-one strongly stable fractional matchings
Random matching under priorities: stability and no envy concepts
Canonical monotone decompositions of fractional stable matchings
Stable matchings and linear programming
Proportional representation in matching markets: selecting multiple matchings under dichotomous preferences
A note on the lattice structure for matching markets via linear programming
Popularity, Mixed Matchings, and Self-Duality
Affinely representable lattices, stable matchings, and choice functions
A polynomial-time algorithm for the bistable roommates problem
On the stable b-matching polytope.
Stable matching: An integer programming approach
Stable matchings and linear inequalities
Competitive pricing and the core: with reference to matching
The object allocation problem with random priorities
Stable allocations and partially ordered sets
Task assignment with controlled and autonomous agents
Monotonicity and consistency in matching markets
Disjoint stable matchings in linear time
An enhanced approach for two-sided matching with 2-tuple linguistic multi-attribute preference
Stable matchings of teachers to schools
On a characterization of stable matchings
A note on ex-ante stable lotteries
Perfect matching interdiction problem restricted to a stable vertex
Blockers and antiblockers of stable matchings
Marginal contribution and singleton cores in one-sided matching and assignment
A theory of fair random allocation under priorities
Existence of stable outcomes and the lattice property for a unified matching market
Affinely representable lattices, stable matchings, and choice functions
Jointly stable matchings
Ex-post stability under two-sided matching: complexity and characterization
The vigilant eating rule: a general approach for probabilistic economic design with constraints
Linear programming brings marital bliss
Integer programming methods for special college admissions problems
Ordinal efficiency and dominated sets of assignments.
Polyhedral aspects of stable marriage
Maximum matchings and popularity
Impossibility results for weak strategy-proofness and respect for improvements in random assignment with priorities
The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching
scientific article; zbMATH DE number 7626775 (Why is no real title available?)
The stable b-matching polytope revisited
Welfare theorems for random assignments with priorities
A unified approach to finding good stable matchings in the hospitals/residents setting
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach
The geometry of fractional stable matchings and its applications
Tâtonnement in matching markets
Fractional matching markets
Stability, optimality and manipulation in matching problems with weighted preferences
Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games
``Almost-stable matchings in the hospitals/residents problem with couples
Review of the theory of stable matchings and contract systems
Marriage market with indifferences: a linear programming approach
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties

This page was built for publication: Stable Matchings, Optimal Assignments, and Linear Programming

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