Manipulation of Optimal Matchings via Predonation of Endowment

In this paper we answer a question posed by Sertel and Ozkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.