General Manipulability Theorem for a Matching Model

• Tác giả: Paola B Manasero, Jorge Oviedo
• Ngôn ngữ: eng
• Ký hiệu phân loại: 511.4 Approximations formerly also 513.24 and expansions
• Thông tin xuất bản: 2022
• Bộ sưu tập: Báo, Tạp chí
• ID: 195907

Tóm tắt

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.