Abstract: 

Abstract: An agency needs to hire a group of individuals as diplomats for a predetermined set of missions, each lasting for a certain duration. Diplomats are reassigned to new missions periodically throughout their career. Missions may require different qualifications and vary in desirability among the diplomats. This paper investigates the design of recruitment procedures that results in a suitable pool of diplomats for the hiring entity to be able to assign an adequately qualified diplomat to each mission while maintaining balance in mission assignments in terms of their desirability. By introducing a new Hall’s type theorem for hypergraphs, we characterize such recruitment procedures. In addition, we show a particular relation structure within the characterized set which constitutes an isomorphism with the merit comparison of the diplomat sets selected under different recruitment procedures.