A multiple-partners assignment game with heterogeneous sells and multi-unit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...

A multiple-partners assignment game with heterogeneous sales and multi-unit demands consists of a set of sellers that own a given number of indivisible units of potentially many different goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...

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

A multiple-partners assignment game with heterogeneous sales and multi-unit demands consists of a set of sellers that own a given number of indivisible units of potentially many different goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...

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

A multiple-partners assignment game with heterogeneous sells and multi-unit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...

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. In order to prove this result, we also show that under this domain of...

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