IDEAS home Printed from https://ideas.repec.org/p/cca/wpaper/23.html
   My bibliography  Save this paper

Application Costs in Sequential Admission Mechanisms

Author

Listed:
  • Matteo Triossi

Abstract

This paper considers a realistic family of admission mechanisms, with multiple applications and application costs. Multiple applications impose serious coordination problems to colleges, but application costs restore stability. Without application costs and under incomplete information unstable allocations emerge.

Suggested Citation

  • Matteo Triossi, 2006. "Application Costs in Sequential Admission Mechanisms," Carlo Alberto Notebooks 23, Collegio Carlo Alberto.
    • Handle: RePEc:cca:wpaper:23
    as

    Download full text from publisher

    File URL: https://www.carloalberto.org/wp-content/uploads/2018/11/no.23.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Alcalde, Jose & Romero-Medina, Antonio, 2005. "Sequential decisions in the college admissions problem," Economics Letters, Elsevier, vol. 86(2), pages 153-158, February.
    2. Alcalde, Jose & Romero-Medina, Antonio, 2000. "Simple Mechanisms to Implement the Core of College Admissions Problems," Games and Economic Behavior, Elsevier, vol. 31(2), pages 294-302, May.
    3. Marilda Sotomayor, 2003. "Reaching the core of the marriage market through a non-revelation matching mechanism," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(2), pages 241-251, December.
    4. Martinez, Ruth & Masso, Jordi & Neme, Alejandro & Oviedo, Jorge, 2000. "Single Agents and the Set of Many-to-One Stable Matchings," Journal of Economic Theory, Elsevier, vol. 91(1), pages 91-105, March.
    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. Antonio Romero-Medina & Matteo Triossi, 2023. "Take-it-or-leave-it contracts in many-to-many matching markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(2), pages 591-623, February.
    2. Romero-Medina, Antonio & Triossi, Matteo, 2014. "Non-revelation mechanisms in many-to-one markets," Games and Economic Behavior, Elsevier, vol. 87(C), pages 624-630.
    3. Alcalde, José, 2016. "(In)visible Hands in Matching Markets," QM&ET Working Papers 16-2, University of Alicante, D. Quantitative Methods and Economic Theory.
    4. Triossi, Matteo, 2009. "Hiring mechanisms, application costs and stability," Games and Economic Behavior, Elsevier, vol. 66(1), pages 566-575, May.
    5. Salgado Alfredo, 2018. "Incomplete Information and Costly Signaling in College Admissions," Working Papers 2018-23, Banco de México.
    6. Kucuksenel Serkan, 2011. "Implementation of the Core in College Admissions Problems When Colleagues Matter," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-14, September.
    7. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    8. Yasushi Kawase & Keisuke Bando, 2021. "Subgame perfect equilibria under the deferred acceptance algorithm," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 503-546, June.
    9. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    10. Alfredo Salgado-Torres, 2012. "A simple decentralized matching mechanism in markets with couples," Economics Bulletin, AccessEcon, vol. 32(3), pages 2044-2055.
    11. 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.
    12. 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.
    13. Bó, Inácio & Hakimov, Rustamdjan, 2022. "The iterative deferred acceptance mechanism," Games and Economic Behavior, Elsevier, vol. 135(C), pages 411-433.
    14. Francis Bloch & Effrosyni Diamantoudi, 2011. "Noncooperative formation of coalitions in hedonic games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 263-280, May.
    15. Klaus, Bettina & Klijn, Flip, 2017. "Non-revelation mechanisms for many-to-many matching: Equilibria versus stability," Games and Economic Behavior, Elsevier, vol. 104(C), pages 222-229.
    16. Antonio Romero-Medina & Matteo Triossi, 2013. "Games with capacity manipulation: incentives and Nash equilibria," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(3), pages 701-720, September.
    17. Guillaume Haeringer & Myrna Wooders, 2011. "Decentralized job matching," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 1-28, February.
    18. Wu, Qinggong, 2015. "A finite decentralized marriage market with bilateral search," Journal of Economic Theory, Elsevier, vol. 160(C), pages 216-242.
    19. Günnur Ege Bilgin, 2024. "Decentralized Many-to-One Matching With Random Search," CRC TR 224 Discussion Paper Series crctr224_2024_541, University of Bonn and University of Mannheim, Germany.

    More about this item

    Keywords

    Application Costs; Matching Markets; Implementation.;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cca:wpaper:23. See general information about how to correct material in RePEc.

    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: Giovanni Bert (email available below). General contact details of provider: https://edirc.repec.org/data/fccaait.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.