IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v77y1997i1p197-204.html
   My bibliography  Save this article

Manipulation via Capacities in Two-Sided Matching Markets

Author

Listed:
  • Sonmez, Tayfun

Abstract

No abstract is available for this item.

Suggested Citation

  • Sonmez, Tayfun, 1997. "Manipulation via Capacities in Two-Sided Matching Markets," Journal of Economic Theory, Elsevier, vol. 77(1), pages 197-204, November.
  • Handle: RePEc:eee:jetheo:v:77:y:1997:i:1:p:197-204
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022-0531(97)92316-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Shin, Sungwhee & Suh, Sang-Chul, 1996. "A mechanism implementing the stable rule in marriage problems," Economics Letters, Elsevier, vol. 51(2), pages 185-189, May.
    2. Andrew Postlewaite, 1979. "Manipulation via Endowments," Review of Economic Studies, Oxford University Press, vol. 46(2), pages 255-262.
    3. Alcalde, Jose, 1996. "Implementation of Stable Solutions to Marriage Problems," Journal of Economic Theory, Elsevier, vol. 69(1), pages 240-254, April.
    4. Alcalde, Jose & Barbera, Salvador, 1994. "Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 4(3), pages 417-435, May.
    5. Sertel, Murat R., 1994. "Manipulating Lindahl equilibrium via endowments," Economics Letters, Elsevier, vol. 46(2), pages 167-171, October.
    6. Ma Jinpeng, 1995. "Stable Matchings and Rematching-Proof Equilibria in a Two-Sided Matching Market," Journal of Economic Theory, Elsevier, vol. 66(2), pages 352-369, August.
    7. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    8. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
    9. Kara, Tarik & Sonmez, Tayfun, 1996. "Nash Implementation of Matching Rules," Journal of Economic Theory, Elsevier, vol. 68(2), pages 425-439, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sonmez, Tayfun, 1997. "Games of Manipulation in Marriage Problems," Games and Economic Behavior, Elsevier, vol. 20(2), pages 169-176, August.
    2. Ergin, Haluk & Sonmez, Tayfun, 2006. "Games of school choice under the Boston mechanism," Journal of Public Economics, Elsevier, vol. 90(1-2), pages 215-237, January.
    3. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    4. Ehlers, Lars & Massó, Jordi, 2015. "Matching markets under (in)complete information," Journal of Economic Theory, Elsevier, vol. 157(C), pages 295-314.
    5. EHLERS, Lars & MASSO, Jordi, 2018. "Robust design in monotonic matching markets: A case for firm-proposing deferred-acceptance," Cahiers de recherche 2018-02, Universite de Montreal, Departement de sciences economiques.
    6. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
    7. Alcalde, José, 2018. "Beyond the Spanish MIR with consent: (Hidden) cooperation and coordination in matching," Games and Economic Behavior, Elsevier, vol. 110(C), pages 32-49.
    8. Matthew O. Jackson, 2001. "A crash course in implementation theory," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(4), pages 655-708.
    9. Sonmez, Tayfun, 1999. "Can Pre-arranged Matches Be Avoided in Two-Sided Matching Markets?," Journal of Economic Theory, Elsevier, vol. 86(1), pages 148-156, May.
    10. Tayfun Sönmez, 1994. "Strategy-proofness in many-to-one matching problems," Review of Economic Design, Springer;Society for Economic Design, vol. 1(1), pages 365-380, December.
    11. Klaus, Bettina & Dimitrov, Dinko & Haake, Claus-Jochen, 2006. "Bundling in exchange markets with indivisible goods," Economics Letters, Elsevier, vol. 93(1), pages 106-110, October.
    12. Sang-Chul Suh & Quan Wen, 2008. "Subgame perfect implementation of stable matchings in marriage problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(1), pages 163-174, June.
    13. Kóczy Á., László, 2009. "Központi felvételi rendszerek. Taktikázás és stabilitás [Central admission systems. Stratagems and stability]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(5), pages 422-442.
    14. Tadenuma, Koichi & Toda, Manabu, 1998. "Implementable stable solutions to pure matching problems," Mathematical Social Sciences, Elsevier, vol. 35(2), pages 121-132, March.
    15. Alcalde, Jose & Romero-Medina, Antonio, 2005. "Sequential decisions in the college admissions problem," Economics Letters, Elsevier, vol. 86(2), pages 153-158, February.
    16. Sonmez, Tayfun, 1996. "Implementation in generalized matching problems," Journal of Mathematical Economics, Elsevier, vol. 26(4), pages 429-439.
    17. Lars Ehlers & Bettina Klaus, 2014. "Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 949-966, November.
    18. Claus-Jochen Haake & Bettina Klaus, 2010. "Stability and Nash implementation in matching markets with couples," Theory and Decision, Springer, vol. 69(4), pages 537-554, October.
    19. Ehlers, Lars, 2004. "In search of advice for participants in matching markets which use the deferred-acceptance algorithm," Games and Economic Behavior, Elsevier, vol. 48(2), pages 249-270, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:77:y:1997:i:1:p:197-204. 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: . General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.