Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Economics

Selected Works

Ted C Bergstrom

1983

Matching

Articles 1 - 1 of 1

Full-Text Articles in Social and Behavioral Sciences

Can Courtship Be Cheatproof?, Ted Bergstrom, Richard Manning Jun 1983

Can Courtship Be Cheatproof?, Ted Bergstrom, Richard Manning

Ted C Bergstrom

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 …