CONICET | Buscador de Institutos y Recursos Humanos

We consider a model of many-to-many matching with contracts where all agents have substitutable preferences. We develop an algorithm to obtain stable allocations from sets of contracts satisfying a significantly less restrictive condition. Then, we use our algorithm to build the optimal stable allocation for one side of the market through a simple process, which is very similar to the pioneering Gale and Shapley´s one. Also, we apply the algorithm to prove that the set of stable allocations has lattice structure with respect to Blair´s partial ordering, and that there exists certain counterposition of interests between doctors and hospitals.