Baïou y Balinski (2002) generalizaron el modelo de asignación empresas-trabajadores a uno donde se planifica la asignación determinando además de la asignación de los trabajadores a las empresas cuánto tiempo los trabajadores le dedicarán a la empresa. Una planificación es estable si...

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...

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 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...

In this paper we analyze the value of the information in a cooperative game. There is a player, the innovator, having a know how or relevant information which is not useful for himself but it can be sold to some potential buyers. The n potential users of the information are involved in a market...