Problem
Research questions and friction points this paper is trying to address.
polyhedral characterization
worker-quasi-stable matchings
one-to-one matching model
A polyhedral characterization of worker-quasi-stable matchings
🤖 AI Summary
本文通过修改经典稳定性约束引入凸多面体，首次对工人准稳定匹配进行了多面体刻画，证明了其整数性。
📝 Abstract
We provide the first polyhedral characterization of worker-quasi-stable matchings in the classical one-to-one matching model. By modifying the classical stability constraints, we introduce a convex polytope and prove that it is integral. Consequently, its extreme points coincide exactly with the incidence vectors of worker-quasi-stable matchings, demonstrating that worker-quasi-stability preserves the geometric tractability of standard stability.
Innovation
Methods, ideas, or system contributions that make the work stand out.
polyhedral characterization
worker-quasi-stable matchings
integral polytope
geometric tractability
🔎 Similar Papers
No similar papers found.
