Advanced Search
MyIDEAS: Login to save this paper or follow this series

An Impossibility Theorem in Matching Problems


Author Info

  • Shohei Takagi
  • Shigehiro Serizawa


This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barber_ (1994) show that efficient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof matching rules by relaxing effciency to the weaker condition of respect for unanimity. Our first result is positive. We prove that a strategy-proof rule exists that is individually rational and respects unanimity. However, this rule is unreasonable in the sense that a pair of agents who are the best for each other are matched on only rare occasions. In order to explore the possibility of better matching rules, we introduce the natural condition of "respect for pairwise unanimity." Respect for pairwise unanimity states that a pair of agents who are the best for each other should be matched, and an agent wishing to stay single should stay single. Our second result is negative. We prove that no strategy-proof rule exists that respects pairwise unanimity. This result implies Roth (1982) showing that stable rules are manipulable. We then extend this to the many-to-one matching model.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Download Restriction: no

Bibliographic Info

Paper provided by Institute of Social and Economic Research, Osaka University in its series ISER Discussion Paper with number 0677.

as in new window
Date of creation: Dec 2006
Date of revision:
Handle: RePEc:dpr:wpaper:0677

Contact details of provider:
Postal: 6-1 Mihogaoka, Ibaraki, Osaka 567-0047
Fax: 81-6-6879-8583
Web page:
More information through EDIRC

Related research



No references listed on IDEAS
You can help add them by filling out this form.



This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dpr:wpaper:0677. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fumiko Matsumoto).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.