International Journal of Game Theory

, Volume 36, Issue 3–4, pp 621–640 | Cite as

The stability of the equilibrium outcomes in the admission games induced by stable matching rules

  • Marilda Sotomayor
Original Paper


A stable matching rule is used as the outcome function for the Admission game where colleges behave straightforwardly and the students’ strategies are given by their preferences over the colleges. We show that the college-optimal stable matching rule implements the set of stable matchings via the Nash equilibrium (NE) concept. For any other stable matching rule the strategic behavior of the students may lead to outcomes that are not stable under the true preferences. We then introduce uncertainty about the matching selected and prove that the natural solution concept is that of NE in the strong sense. A general result shows that the random stable matching rule, as well as any stable matching rule, implements the set of stable matchings via NE in the strong sense. Precise answers are given to the strategic questions raised.


Stable matching Nash equilibrium Mechanism Stablematching rule Random stable matching rule 

JEL Classification

C78 D78 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Abdulkadiroglu, A, Sonmez, T: School choice: a mechanism design approach. Am Econ Rev 93, 729–747 (2003)CrossRefGoogle Scholar
  2. Alcalde, J: Implementation of stable solutions to marriage problems. J Econ Theory 69, 240–254 (1996)CrossRefGoogle Scholar
  3. Alcalde, J, Medina, R: Simple mechanisms to implement the core of center admission problems. Games Econ Behav 31(2), 294–302 (2000)CrossRefGoogle Scholar
  4. Alcalde, J, Medina, R, Medina, R: Hiring procedures to implement stable allocations. J Econ Theory 82(2), 469–480 (1998)CrossRefGoogle Scholar
  5. Aumann RJ (1959) Acceptable points in general cooperation n-persons games. In: Contributions to the Theory of Games IV. Princeton University Press, PrincetonGoogle Scholar
  6. Balinski, M, Sonmez, T: A tale of two mechanisms: student placement. J Econ Theory 84, 73–94 (1999)CrossRefGoogle Scholar
  7. Demange, G, Gale, D: The strategy structure of two-sided matching markets. Econometrica 53, 873–888 (1985)CrossRefGoogle Scholar
  8. Dubins, LE, Freedman, DA: Machiavelli and the Gale–Shapley algorithm. Am Math Mon 88, 485–494 (1981)CrossRefGoogle Scholar
  9. Gale, D, Shapley, L: Center admission and the stability of marriage. Am Math Mon 69, 9–15 (1962)CrossRefGoogle Scholar
  10. Gale, D, Sotomayor, M: Some remarks on the stable matching problem. Discrete Appl Math 11, 223–232 (1985a)CrossRefGoogle Scholar
  11. Gale, D, Sotomayor, M: Ms. Machiavelli and the stable matching problem. Am Math Mon 92, 261–268 (1985b)CrossRefGoogle Scholar
  12. Kesten, O: On two competing mechanisms for priority-based allocation problems. J Econ Theory 127, 155–171 (2006a)CrossRefGoogle Scholar
  13. Kesten O (2006b) Student placement to public schools in the US: Two new solutions. mimeo, Harvard Business SchoolGoogle Scholar
  14. Pais (2007) Random matching in the college admissions problem. Econ Theory (in press)Google Scholar
  15. Romero-Medina, A: Implementation of stable solutions in a restricted matching market. Rev Econ Des 3(2), 137–147 (1998)Google Scholar
  16. Roth, A: Misrepresentation and stability in the marriage problem. J Econ Theory 34, 383–387 (1984)CrossRefGoogle Scholar
  17. Roth, A: The college admissions problem is not equivalent to the marriage problem. J Econ Theory 36, 277–288 (1985)CrossRefGoogle Scholar
  18. Roth, A, Sotomayor, M: The center admission problem revisited. Econometrica 57, 85–101 (1989)CrossRefGoogle Scholar
  19. Roth A, Sotomayor M (1990) Two-sided matching. A study in game-theoretic modeling and analysis. In: Econometric society monographs, no. 18. Cambridge University Press, CambridgeGoogle Scholar
  20. Sotomayor, M: A non-constructive elementary proof of the existence of stable marriages. Games Econ Behav 13, 135–137 (1996a)CrossRefGoogle Scholar
  21. Sotomayor M (1996b) Admission mechanisms of students to colleges. A game-theoretic modeling and analysis, Brazilian Review of Econometrics, vol. 16, No 1, pp 25–63. (Annals of Brazilian Meeting of Econometrics, Florianópolis, Brazil (1995))Google Scholar
  22. Sotomayor M (1998) The strategy structure of the college admissions stable mechanisms. Mimeo (Annals of Jornadas Latino Americanas de Teoria Econômica, San Luis, Argentina (2000), First World Congress of the Game Theory Society (Bilbao, 2000), 4th Spanish Meeting Valencia 2000), International Symposium of Mathematical Programming (Atlanta, 2000), World Congress of the Econometric Society (Seattle, 2000)Google Scholar
  23. Sotomayor, M: Three remarks on the many to many matching problem. Math Soc Sci 38, 55–70 (1999)CrossRefGoogle Scholar
  24. Sotomayor M (2000) Reaching the core through college admissions stable mechanisms. Mimeo. Annals of abstracts of the following congresses: International Conference on Game Theory (2001, Stony Brook). Annals of Brazilian Meeting of Econometrics (Salvador, Brazil, (2001), Latin American Meeting of the Econometric Society (Buenos Aires, Argentina, 2001)Google Scholar
  25. Sotomayor M (2002) Market clearing price mechanisms, mimeoGoogle Scholar
  26. Sotomayor, M: Reaching the core of the marriage market through a non-revelation matching mechanism. Int J Game Theory 32(2), 241–251 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  1. 1.Departamento de EconomiaUniversidade de São PauloSão PauloBrazil

Personalised recommendations