This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Stable Matchings and the Small Core in Nash Equilibrium in the College Admissions Problem

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Jinpeng Ma

Additional information is available for the following registered author(s):

Abstract

Both rematching proof and strong equilibrium outcomes are stable with respect to the true preferences in the marriage problem. We show that not all rematching proof or strong equilibrium outcomes are stable in the college admissions problem. But we show that both rematching proof and strong equilibrium outcomes with truncations at the match point are all stable in the college admissions problem. Further, all true stable matchings can be achieved in both rematching proof and strong equilibrium with truncations at the match point. We show that any Nash equilibrium in truncations admits one and only one matching, stable or not. Therefore, the core at a Nash equilibrium in truncations must be small. But examples exist such that the set of stable matchings with respect to a Nash equilibrium may contain more than one matching. Nevertheless, each Nash equilibrium can only admit at most one true stable matching. If, indeed, there is a true stable matching at a Nash equilibrium, then the only possible equilibrium outcome will be the true stable matching, no matter how players manipulate their equilibrium strategies and how many other unstable matchings are there at the Nash equilibrium. Thus, we show that a necessary and sufficient condition for the stable matching rule to be implemented in a subset of Nash equilibria by a direct revelation game induced by a stable matching mechanism is that every Nash equilibrium profile in that subset admits one and only one true stable matching.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.kellogg.northwestern.edu/research/math/papers/1247.pdf
File Format: application/pdf
File Function: main text
Download Restriction: no

Publisher Info
Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1247.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Nov 1998
Date of revision:
Handle: RePEc:nwu:cmsems:1247

Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Phone: 847/491-3527
Fax: 847/491-2530
Email:
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC

Order Information:
Email:

For technical questions regarding this item, or to correct its listing, contact: (Fran Walker).

Related research
Keywords:

Find related papers by JEL classification:
C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

Statistics
Access and download statistics

Did you know? RePEc also has a blog.

This page was last updated on 2009-12-21.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.