Stable solutions on many-to-one matching models with quota restriction with substitutable preferences for one side of agents

Resumen

In this paper a variant to the many-to-one matching model is presented, in which two types of complementary agents and an institution intervene. The latter wants to assign agents to perform certain tasks, each (d ,e) ? of which can be done by one agent from one set with many agents from the other. The institution has preferences over the possible matchings and a quota q, which is the maximum number of agents it can hire. In this model, considering substitutable preferences for one of the agent sets, a concept of stability is extended in a natural way and the concept of E q -stability is defined. It is shown, under the institution’s responsive preference constraint, that there is an algorithm by means of which the existence of the set of E q -stable matchings is guaranteed.