Manipulation of optimal matchings via predonation of endowment
2004
In this paper we answer a question posed by Sertel and 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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
11
References
5
Citations
NaN
KQI