Implementation of college admission rules (*)

Tayfun Sönmez and Tarik Kara
Additional contact information
Tarik Kara: Department of Economics, University of Rochester, Rochester, NY 14627, USA

Economic Theory, 1997, vol. 9, issue 2, 197-218

Abstract: We consider both Nash and strong Nash implementation of various matching rules for college admissions problems. We show that all such rules are supersolutions of the stable rule. Among these rules the "lower bound" stable rule is implementable in both senses. The "upper bound" Pareto and individually rational rule is strong Nash implementable yet it is not Nash implementable. Two corollaries of interest are the stable rule is the minimal (Nash or strong Nash) implementable solution that is Pareto optimal and individually rational, and the stable rule is the minimal (Nash or strong Nash) implementable extension of any of its subsolutions.

JEL-codes: C78 D78 (search for similar items in EconPapers)
Date: 1997
Note: Received: August 22, 1994; revised version July 6, 1995
References: Add references at CitEc
Citations: View citations in EconPapers (48)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joecth:v:9:y:1997:i:2:p:197-218

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2

Access Statistics for this article

Economic Theory is currently edited by Nichoals Yanneils

More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().