(Group) Strategy-Proofness in Many-to-Many Matching Markets

We study strategy-proofness in many-to-many matching problems. We prove that when firms have acyclical preferences over workers, we can generate a stable matching through a serial dictatorship among workers. This mechanism is... [ view full abstract ]

We study strategy-proofness in many-to-many matching problems. We prove that when firms have acyclical preferences over workers, we can generate a stable matching through a serial dictatorship among workers. This mechanism is group strategy-proof, Pareto optimal, and its outcome coincides with the worker-optimal stable matching. Also, under acyclicity, the set of stable matchings is a singleton.