IDEAS home Printed from https://ideas.repec.org/p/cte/werepe/we1018.html

Non-revelation mechanisms in many-to-one markets

Author

Listed:
  • Romero-Medina, Antonio
  • Triossi, Matteo

Abstract

This paper presents a sequential admission mechanism where students are allowed to send multiple applications to colleges and colleges sequentially decide the applicants to enroll. The irreversibility of agents decisions and the sequential structure of the enrollments make truthful behavior a dominant strategy for colleges. Due to these features, the mechanism implements the set of stable matchings in Subgame Perfect Nash equilibrium. We extend the analysis to a mechanism where colleges make proposals to potential students and students decide sequentially. We show that this mechanism implements the stable set as well.

Suggested Citation

  • Romero-Medina, Antonio & Triossi, Matteo, 2010. "Non-revelation mechanisms in many-to-one markets," UC3M Working papers. Economics we1018, Universidad Carlos III de Madrid. Departamento de Economía.
    • Handle: RePEc:cte:werepe:we1018
    as

    Download full text from publisher

    File URL: https://e-archivo.uc3m.es/rest/api/core/bitstreams/7b35061a-08d1-4a71-8299-86129a0d3947/content
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. BONKOUNGOU, Somouaoga, 2016. "Pareto dominance of deferred acceptance through early decision," Cahiers de recherche 2016-07, Universite de Montreal, Departement de sciences economiques.
    2. 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.
    3. 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.
    4. 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.
    5. Alfredo Salgado-Torres, 2012. "A simple decentralized matching mechanism in markets with couples," Economics Bulletin, AccessEcon, vol. 32(3), pages 2044-2055.
    6. Somouaoga Bonkoungou, 2021. "Decentralized college admissions under single application," Review of Economic Design, Springer;Society for Economic Design, vol. 25(1), pages 65-91, June.
    7. Tommy Andersson & Umut Dur & Sinan Ertemel & Onur Kesten, 2024. "Sequential school choice with public and private schools," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(2), pages 231-276, September.
    8. Bó, Inácio & Hakimov, Rustamdjan, 2022. "The iterative deferred acceptance mechanism," Games and Economic Behavior, Elsevier, vol. 135(C), pages 411-433.
    9. Salgado Alfredo, 2018. "Incomplete Information and Costly Signaling in College Admissions," Working Papers 2018-23, Banco de México.
    10. 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.
    11. José Alcalde, 2016. "(In)visible Hands in Matching Markets," QM&ET Working Papers 16-2, University of Alicante, D. Quantitative Methods and Economic Theory.
    12. Somouaoga BONKOUNGOU, 2016. "Pareto Dominance of Deferred Acceptance through Early Decision," Cahiers de recherche 11-2016, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    13. B. Evci, 2014. "A new dynamic mechanism to the marriage problem with a variant," Working Papers wp973, Dipartimento Scienze Economiche, Universita' di Bologna.
    14. repec:hhs:lunewp:2023_012 is not listed on IDEAS
    15. 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.

    More about this item

    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:cte:werepe:we1018. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Ana Poveda (email available below). General contact details of provider: http://www.eco.uc3m.es/ .

    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.