Deferred acceptance is minimally manipulable

  • Martin Van der LindenEmail author
Original Paper


This paper shows that the deferred acceptance mechanism (DA) cannot be improved upon in terms of manipulability without compromising stability. A conflict between manipulability and fairness is also identified. Stable mechanisms that minimize the set of individuals who match with their least preferred achievable mate are shown to be maximally manipulable among the stable mechanisms. These mechanisms are also more manipulable than DA. A similar conflict between fairness and manipulability is identified in the case of the median stable mechanisms.


Matching Deferred acceptance Manipulability Stability Fairness 


C78 D47 D82 

Supplementary material


  1. Aleskerov F, Kurbanov E (1999) Degree of manipulability of social choice procedures. In: Alkan PA, Aliprantis PCD, Yannelis PNC (eds) Curr Trends Econ. Springer, Berlin Heidelberg, pp 13–27CrossRefGoogle Scholar
  2. Andersson T, Ehlers L, Svensson LG (2014) Least manipulable envy-free rules in economies with indivisibilities. Math Soc Sci 69:43–49CrossRefGoogle Scholar
  3. Arribillaga RP, Massó J (2015) Comparing generalized median voter schemes according to their manipulability. Theor Econ 11:547–586CrossRefGoogle Scholar
  4. Ashlagi I, Kanoria Y, Leshno JD (2016) Unbalanced random matching markets: the stark effect of competition. J Political Econ 125:69–98CrossRefGoogle Scholar
  5. Barberà S, Gerber A (2017) Sequential voting and agenda manipulation. Theor Econ 12:211–247CrossRefGoogle Scholar
  6. Chen P, Egesdal M, Pycia M, Yenmez MB (2016) Manipulability of stable mechanisms. Am Econ J Microecon 8:202–214CrossRefGoogle Scholar
  7. Coles P, Shorrer R (2014) Optimal truncation in matching markets. Games Econ Behav 87:591–615CrossRefGoogle Scholar
  8. Decerf B, Van der Linden M (2016) Manipulability and tie-breaking in constrained school choice. SSRN working paper no. 2809566Google Scholar
  9. Echenique F, Wilson AJ, Yariv L (2016) Clearinghouses for two-sided matching: an experimental study. Quant Econ 7:449–482CrossRefGoogle Scholar
  10. Echenique F, Yariv L (2012) An experimental study of decentralized matching. Working paperGoogle Scholar
  11. Fujinaka Y, Wakayama T, (2012) Maximal manipulation in fair allocation. SSRN Working Paper No. 2051296Google Scholar
  12. Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Monthly 69:9–15CrossRefGoogle Scholar
  13. Hassidim A, Romm A, Shorrer R.I (2017) Need vs. Merit: The Large Core of College Admissions Markets. SSRN Working Paper No. 3071873Google Scholar
  14. Irving RW, Leather P, Gusfield D (1987) An efficient algorithm for the “optimal” stable marriage. J ACM 34:532–543CrossRefGoogle Scholar
  15. Klaus B, Klijn F (2006) Median stable matching for college admissions. Int J Game Theory 34:1–11CrossRefGoogle Scholar
  16. Knuth DE (1997) Stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms. American Mathematical Society, Providence, RIGoogle Scholar
  17. Kojima F, Pathak PA (2009) Incentives and stability in large two-sided matching markets. Am Econ Rev 99:608–627CrossRefGoogle Scholar
  18. Lee S (2017) Incentive compatibility of large centralized matching markets. Rev Econ Stud 84:444–463CrossRefGoogle Scholar
  19. Maus S, Peters H, Storcken T (2007) Anonymous voting and minimal manipulability. J Econ Theory 135:533–544CrossRefGoogle Scholar
  20. Pathak PA, Sönmez T (2013) School admissions reform in Chicago and England: Comparing mechanisms by their vulnerability to manipulation. Am Econ Rev 103:80–106CrossRefGoogle Scholar
  21. Pittel B, Shepp L, Veklerov E (2008) On the number of fixed pairs in a random instance of the stable marriage problem. SIAM J Discrete Math 21:947–958CrossRefGoogle Scholar
  22. Roth A (1982) The economics of matching: stability and incentives. Math Oper Res 7:617–628CrossRefGoogle Scholar
  23. Roth A (1985) The college admissions problem is not equivalent to the marriage problem. J Econ Theory 288:277–288CrossRefGoogle Scholar
  24. Roth A, Sotomayor M (1990) Two-Sided Matching: a study in game-theoretic modeling and analysis. Number 18 in Econometric Society monographs, Cambridge University Press, CambridgeGoogle Scholar
  25. Sen A (1999) The possibility of social choice. Am Econ Rev 89:349–378CrossRefGoogle Scholar
  26. Sethuraman J, Teo CP, Qian L (2006) Many-to-one stable matching: geometry and fairness. Math Oper Res 31:581–596CrossRefGoogle Scholar
  27. Teo CP, Sethuraman J (1998) The geometry of fractional stable matchings and its applications. Math Oper Res 23:874–891CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Utah State UniversityLoganUSA

Personalised recommendations