This paper proposes a reform for school allocation procedures in order to help integration policies reach their objective. For this purpose, we suggest the use of a natural two-step mechanism. The (stable) first step is introduced as an adaptation of the deferred-acceptance algorithm designed by...

A minimum cost spanning tree (mcst) problem analyzes the way to effciently connect individuals to a source when they are located at different places. Once the effcient tree is obtained, the question on how allocating the total cost among the involved agents defines, in a natural way, a...

It is well known that the core of an exchange market with indivisible goods is always non empty, although it may contain Pareto inecient allocations. The strict core solves this shortcoming when indiff erences are not allowed, but when agents' preferences are weak orders the strict core may be...

It is usually assumed that maximal elements are the best option for an agent. But there are situations in which we can observe that maximal elements are “different” one from another. This is the case of partial orders, in which one maximal element can be strictly preferred to almost every...