arXiv · 2210.06549
General Manipulability Theorem for a Matching Model
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Paola B. Manasero, Jorge Oviedo. 2022-10-12. General Manipulability Theorem for a Matching Model. https://arxiv.org/abs/2210.06549
Cite the original work for its findings. Save a collection to share your selection of sources.