A Matroid Generalization of the Stable Matching Polytope

Authors:
Tamás Fleiner
Affiliations:
-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 2
Cited 2

Characterization of stable matchings as extreme points of a polytope

Mathematical Programming: Series A and B
A fixed-point approach to stable matchings and some applications

Mathematics of Operations Research

A matroid approach to stable matchings with lower quotas

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Note: Blockers and antiblockers of stable matchings

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

By solving a constrained matroid intersection problem, we give a matroid generalization of the stable marriage theorem of Gale and Shapley. We describe the related matroid-kernel polytope, an extension of the stable matching polytope. Linear conditions of the characterizations resemble to the ones that describe the matroid intersection polytope.