Overview
This research investigates the mathematical properties of the stable marriage polytope. A stable matching is defined within a bipartite preference system as a matching devoid of any unmatched pair whose endpoints mutually prefer each other over their current assignments. The stable marriage polytope represents the convex hull of the incidence vectors associated with these stable matchings.
Rothblum previously provided a linear description for the stable marriage polytope. This work specifically demonstrates that this polytope satisfies the condition of being box-totally dual integral.
Research Context
The concept of stable matching originates from the field of combinatorial optimization and game theory, particularly relevant to resource allocation and assignment problems where agents have preferences. The stable marriage polytope serves as a geometric representation of the solution space for stable matching problems.
Rothblum's contribution was the establishment of a linear description for this polytope. A polyhedron is considered totally dual integral (TDI) if, for any integral vector $c$, the dual program $\max \{ c^T y \mid A^T y = c, y \ge 0 \}$ has an integral optimal solution whenever it has an optimal solution. Kiraly and Pap had previously established that Rothblum's description of the stable marriage polytope is totally dual integral.
The property of being box-totally dual integral (box-TDI) is a stronger condition than total dual integrality. A system of linear inequalities $Ax \le b$ is box-TDI if the polyhedron $P = \{ x \mid Ax \le b, \ell \le x \le u \}$ is TDI for all integral vectors $\ell$ and $u$.
Approach
The proof that the stable marriage polytope is box-totally dual integral utilizes two main components:
- The affine representation of the stable marriage polytope as an order polytope. This transformation maps the stable marriage problem into a different polyhedral structure, simplifying certain analytical aspects.
- The matricial characterization of box-TDI polyhedra. This involves applying specific algebraic criteria related to matrices to determine if a given polyhedron exhibits the box-TDI property.
Findings
The central finding of this research is the proof that the stable marriage polytope is box-totally dual integral. This result is established by leveraging its affine representation as an order polytope and applying the matricial characterization specific to box-TDI polyhedra.
An implication of this finding is its relationship to prior work by Kiraly and Pap. Since Kiraly and Pap had already proven that Rothblum's description of the stable marriage polytope is totally dual integral, this new result extends their finding. The property of being box-totally dual integral is a stronger condition than being totally dual integral. Therefore, the demonstration that the stable marriage polytope is box-totally dual integral inherently implies that Rothblum's system is also box-totally dual integral, building upon and strengthening existing knowledge of its polyhedral characteristics.
Why This Matters
Understanding the polyhedral properties of combinatorial structures like the stable marriage polytope is foundational in mathematical optimization. The box-totally dual integral property has implications for the integrality of solutions in related optimization problems. This property can ensure that certain optimization problems involving stable matchings will always have integral solutions under various bound constraints, which is crucial for practical applications where fractional assignments are not meaningful.