Contractor Selection for Defense Acquisition with Advanced Many-to-One Stable Matching Model

Abstract

For a long time, the monopoly of military enterprises in defense acquisition projects (DAPs) has limited the participation of many civilian enterprises. It results in a lack of innovation and the occurrence of substandard projects. Therefore, the paper proposes a stable matching programming model to give a fair and stable matching solution, to improve attractiveness for civilian enterprises significantly because it gives both parties the right to evaluate each other and thus can ensure fairness in the acquisition procedure. We improve the model by proposing a new stable matching constraint to adapt the particular situation, that is, the number of DAPs that a contractor can undertake is not invariant, but dynamically determined by the required resources of selected DAPs. Finally, we use a case to illustrate the effectiveness of the proposed model by obtaining a fair and stable matching solution between DAPs and enterprises.