Advanced Search
MyIDEAS: Login to save this article or follow this journal

Implementation of college admission rules (*)

Contents:

Author Info

  • Tayfun Sönmez

    (Department of Economics, University of Michigan, Ann Arbor, MI 48109, USA)

  • Tarik Kara

    (Department of Economics, University of Rochester, Rochester, NY 14627, USA)

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.

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Article provided by Springer in its journal Economic Theory.

Volume (Year): 9 (1997)
Issue (Month): 2 ()
Pages: 197-218

as in new window
Handle: RePEc:spr:joecth:v:9:y:1997:i:2:p:197-218

Note: Received: August 22, 1994; revised version July 6, 1995
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

Related research

Keywords:

Find related papers by JEL classification:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

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

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:9:y:1997:i:2:p:197-218. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.