We introduce a solution concept for dynamic one-sided matching models, called the Dynamic Core. The Dynamic Core is defined for a general class of dynamic markets where agents and objects arrive over time, and objects can be privately or collectively owned. We prove that the Dynamic Core is not...

We propose a simple model in which agents are matched in pairs in order to complete a task of unit size. The preferences of agents are single-peaked and continuous on the amount of time they devote to it. Our model combines features of two models: assignment games (Shapley and Shubik (1971)) and...

We study the problem of an organization that has a large number of potential tasks and has to choose which tasks to handle and which pair of experts assign to each of them. We propose a mechanism that generates a Pareto-efficient assignment in the weak core and is group strategy-proof. The...