Stable matching: an integer programming approach

• Tác giả: Chao Huang
• Ngôn ngữ: eng
• Ký hiệu phân loại: 519.7 Programming
• Thông tin xuất bản: 2021
• Bộ sưu tập: Metadata
• ID: 166460

Tóm tắt

This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matchings exist in a discrete matching market when firms' preference profile satisfies a total unimodularity condition that is compatible with various forms of complementarities. We provide a class of firms' preference profiles that satisfy this condition.