Theory of linear and integer programming
Theory of linear and integer programming
The lattice structure of the set of stable matchings with multiple partners
Mathematics of Operations Research
The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Characterization of stable matchings as extreme points of a polytope
Mathematical Programming: Series A and B
A new fixed point approach for stable networks and stable marriages
Journal of Computer and System Sciences
A New Approach to Stable Matching Problems
SIAM Journal on Computing
The list chromatic index of a bipartite multigraph
Journal of Combinatorial Theory Series B
A Matroid Generalization of the Stable Matching Polytope
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Journal of Combinatorial Theory Series B
On a generalization of the stable roommates problem
ACM Transactions on Algorithms (TALG)
A general two-sided matching market with discrete concave utility functions
Discrete Applied Mathematics
Two algorithms for the Student-Project Allocation problem
Journal of Discrete Algorithms
Many-to-One Stable Matching: Geometry and Fairness
Mathematics of Operations Research
Mathematics of Operations Research
Improved approximation results for the stable marriage problem
ACM Transactions on Algorithms (TALG)
A 1.875: approximation algorithm for the stable marriage problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Uncoordinated two-sided matching markets
Proceedings of the 9th ACM conference on Electronic commerce
Uncoordinated two-sided matching markets
ACM SIGecom Exchanges
A general two-sided matching market with discrete concave utility functions
Discrete Applied Mathematics
A unified approach to congestion games and two-sided markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
The stable roommates problem with choice functions
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
The generalized median stable matchings: finding them is not that easy
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The College Admissions problem with lower and common quotas
Theoretical Computer Science
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Local matching dynamics in social networks
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Uncoordinated Two-Sided Matching Markets
SIAM Journal on Computing
A matroid approach to stable matchings with lower quotas
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Local matching dynamics in social networks
Information and Computation
Note: Blockers and antiblockers of stable matchings
Theoretical Computer Science
Hi-index | 0.00 |
We describe a fixed-point based approach to the theory of bipartite stable matchings. By this, we provide a common framework that links together seemingly distant results, like the stable marriage theorem of Gale and Shapley, the Mendelsohn-Dulmage theorem, the Kundu-Lawler theorem, Tarski's fixed-point theorem, the Cantor-Bernstein theorem, Pym's linking theorem, or the monochromatic path theorem of Sands et al. In this framework, we formulate a matroid-generalization of the stable marriage theorem and study the lattice structure of generalized stable matchings. Based on the theory of lattice polyhedra and blocking polyhedra, we extend results of Vande Vate and Rothblum on the bipartite stable matching polytope.