We formulate a general model and stability notion for two-sided pairwise matching problems with individually insignificant agents. Matchings are formulated as joint distributions over the characteristics of the populations to be matched. These characteristics can be high-dimensional and need not...

The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case of uncoordinated processes in stable allocation...