In this paper, we answer a question posed by Math.soc.sci 44 (2002) 65 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. © 2003 Elsevier B.V. All rights reserved.
|Journal||Mathematical Social Sciences|
|Publication status||Published - 1 May 2004|