IDEAS home Printed from https://ideas.repec.org/a/ebl/ecbull/eb-11-00531.html
   My bibliography  Save this article

Manilulation via endowments in university-admission problem

Author

Listed:
  • Doruk İriş

    (Universidade Nova de Lisboa)

  • İpek Özkal-Sanver

    (Istanbul Bilgi University)

Abstract

We consider a two-sided many-to-one matching model where universities offer scholarships to students. We show that every stable matching rule is manipulable by a university via destroying endowments under a fairly wide class of scholarship rules. Furthermore, we show that the set of Nash equilibria of the destruction game and the set of stable matchings may be disjoint.

Suggested Citation

  • Doruk İriş & İpek Özkal-Sanver, 2011. "Manilulation via endowments in university-admission problem," Economics Bulletin, AccessEcon, vol. 31(4), pages 2952-2958.
    • Handle: RePEc:ebl:ecbull:eb-11-00531
    as

    Download full text from publisher

    File URL: http://www.accessecon.com/Pubs/EB/2011/Volume31/EB-11-V31-I4-P267.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Murat Atlamaz & Bettina Klaus, 2007. "Manipulation via Endowments in Exchange Markets with Indivisible Goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(1), pages 1-18, January.
    2. Sertel, Murat R. & Ozkal-Sanver, Ipek, 2002. "Manipulability of the men- (women-) optimal matching rule via endowments," Mathematical Social Sciences, Elsevier, vol. 44(1), pages 65-83, September.
    3. 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.
    4. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Muto, Nozomu & Shirata, Yasuhiro, 2017. "Manipulation via endowments in auctions with multiple goods," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 75-84.

    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. Schummer, James & Abizada, Azar, 2017. "Incentives in landing slot problems," Journal of Economic Theory, Elsevier, vol. 170(C), pages 29-55.
    2. 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.
    3. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    4. de Regt, E.R., 2005. "Overtime and short-time with fluctuating absenteeism and demand," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    5. Takumi Kongo, 2013. "An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(2), pages 461-478, February.
    6. Wu, Qingyun & Roth, Alvin E., 2018. "The lattice of envy-free matchings," Games and Economic Behavior, Elsevier, vol. 109(C), pages 201-211.
    7. Hatfield, John William & Kojima, Fuhito, 2009. "Group incentive compatibility for matching with contracts," Games and Economic Behavior, Elsevier, vol. 67(2), pages 745-749, November.
    8. William Phan, 2019. "Efficient and incentive compatible exchange of real-time information," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(1), pages 205-242, March.
    9. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    10. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Levine's Bibliography 122247000000001022, UCLA Department of Economics.
    11. Bettina Klaus & Flip Klijn, 2007. "Fair and efficient student placement with couples," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(2), pages 177-207, October.
    12. Committee, Nobel Prize, 2012. "Alvin E. Roth and Lloyd S. Shapley: Stable allocations and the practice of market design," Nobel Prize in Economics documents 2012-1, Nobel Prize Committee.
    13. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the New York City High School Match," NBER Working Papers 14864, National Bureau of Economic Research, Inc.
    14. Ozkal-Sanver, Ipek & Remzi Sanver, M., 2005. "Implementing matching rules by type pretension mechanisms," Mathematical Social Sciences, Elsevier, vol. 50(3), pages 304-317, November.
    15. Katarina Cechlarova & Bettina Klaus & David F.Manlove, 2018. "Pareto optimal matchings of students to courses in the presence of prerequisites," Cahiers de Recherches Economiques du Département d'économie 16.04, Université de Lausanne, Faculté des HEC, Département d’économie.
    16. Braun Sebastian & Dwenger Nadja & Kübler Dorothea, 2010. "Telling the Truth May Not Pay Off: An Empirical Study of Centralized University Admissions in Germany," The B.E. Journal of Economic Analysis & Policy, De Gruyter, vol. 10(1), pages 1-38, March.
    17. Fujinaka, Yuji & Wakayama, Takuma, 2018. "Endowments-swapping-proof house allocation," Games and Economic Behavior, Elsevier, vol. 111(C), pages 187-202.
    18. 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.
    19. Parag A. Pathak & Tayfun Sönmez, 2013. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," American Economic Review, American Economic Association, vol. 103(1), pages 80-106, February.

    More about this item

    Keywords

    University-admission problem; Endowments; Manipulation;
    All these keywords.

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    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:ebl:ecbull:eb-11-00531. 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: John P. Conley (email available below). General contact details of provider: .

    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.