یک مشکل مطابق با بسیاری از افراد به یک طرف

This study discusses a one-sided many-to-many matching model wherein agents may not be divided into two disjoint sets. Moreover, each agent is allowed to have multiple partnerships in our model. We restrict our attention to the case where the preference of each agent is single-peaked over: (i) the total number of partnerships with all other agents, and (ii) the number of partnerships that the agent has with each of the other agents. We represent a matching as a multigraph, and characterize a matching that is stable and constrained efficient. Finally, we show that any direct mechanism for selecting a stable and constrained efficient matching is not strategy-proof.