General Manipulability Theorem for a Matching Model
2022-10-12Unverified0· sign in to hype
Paola B. Manasero, Jorge Oviedo
Unverified — Be the first to reproduce this paper.
ReproduceAbstract
In a many-to-many matching model in which agents' preferences satisfy substitutability and the law of aggregate demand, we proof the General Manipulability Theorem. We result generalizes the presented in Sotomayor (1996 and 2012) for the many-to-one model. In addition, we show General Manipulability Theorem fail when agents' preferences satisfy only substitutability.