We consider the general many-to-one matching model with ordinal preferences and give a procedure to partition the set of preference profiles into subsets with the property that all preference profiles in the same subset have the same Core. We also show how to identify a profile of (incomplete)...

In this paper, we present a matching market in which an institution has to hire a set of pairs of complementary workers, and has a quota that is the maximum number of candidates pair positions to be filled. We define a stable solution and first show that in the unrestricted institution...

For the many-to-one matching model in which firms have substitutable and quota q−separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. Therefore, in centralized markets like entry-level professional labor...

The Blocking Lemma identifies a particular blocking pair for each non-stable and individually rational matching that is preferred by some agents of one side of the market to their optimal stable matching. Its interest lies in the fact that it has been an instrumental result to prove key results...

In this paper we analyze the value of the information in a cooperative model. There is an agent (the innovator), having relevant information which can be sold to some potential buyers. The n potential users of the information share a market. The expected utility of each of them can be improved...