Abstract

For a many-to-many matching model with contracts, where all the agents have substitutable preferences, we provide an algorithm to compute the full set of stable allocations. This is based on the lattice structure of such set.