•   •   •   •

This paper appeared as a University of Michigan working paper, but has not been published.

Download the Paper (563 K, PDF file) - July 1, 1983 Tell a colleague about it. Printing Tips: Select 'print as image' in the Acrobat print dialog if you have trouble printing.

ABSTRACT:
In 1983, I told Richard Manning about Gale and Shapley's beautiful 1962 paper on matching. He asked whether in the Gale-Shapley it was in the interest of all participants to tell the truth. We rather quickly showed that in general it is not in the interest of the recipients of offers to be truthful. In fact we were able to show that no mechanism can guarantee efficient assignments and be cheatproof. We were very pleased. We sent it to a journal, only to learn that Al Roth had beat us to it in a paper that was to appear in JET in 1984. Roth's paper was not only earlier, but deeper and better than ours. But our proof is different from his and our example might still be of interest.

SUGGESTED CITATION:
Ted Bergstrom and Richard Manning, "Can Courtship be Cheatproof?" (July 1, 1983). Department of Economics, UCSB. Ted Bergstrom. Paper 1983C.
http://repositories.cdlib.org/ucsbecon/bergstrom/1983C