IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v9y1997i2p197-218.html
   My bibliography  Save this article

Implementation of college admission rules (*)

Author

Listed:
  • 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.

Suggested Citation

  • Tayfun Sönmez & Tarik Kara, 1997. "Implementation of college admission rules (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 9(2), pages 197-218.
  • Handle: RePEc:spr:joecth:v:9:y:1997:i:2:p:197-218 Note: Received: August 22, 1994; revised version July 6, 1995
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    References listed on IDEAS

    as
    1. Stanley Reynolds & John Wooders, 2009. "Auctions with a buy price," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), pages 9-39.
    2. Bulow, Jeremy & Roberts, John, 1989. "The Simple Economics of Optimal Auctions," Journal of Political Economy, University of Chicago Press, vol. 97(5), pages 1060-1090, October.
    3. Budish, Eric B. & Takeyama, Lisa N., 2001. "Buy prices in online auctions: irrationality on the internet?," Economics Letters, Elsevier, vol. 72(3), pages 325-333, September.
    4. Matthews, Steven A., 1983. "Selling to risk averse buyers with unobservable tastes," Journal of Economic Theory, Elsevier, vol. 30(2), pages 370-400, August.
    5. Timothy Mathews & Brett Katzman, 2006. "The role of varying risk attitudes in an auction with a buyout option," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 27(3), pages 597-613, April.
    6. J. Riley & E. Maskin, 1981. "Optimal Auctions with Risk Averse Buyers," Working papers 311, Massachusetts Institute of Technology (MIT), Department of Economics.
    7. Hidvegi, Zoltan & Wang, Wenli & Whinston, Andrew B., 2006. "Buy-price English auction," Journal of Economic Theory, Elsevier, vol. 129(1), pages 31-56, July.
    8. Paul Milgrom & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
    9. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, December.
    10. George Deltas, 2002. "Determining damages from the operation of bidding rings: An analysis of the post-auction `knockout' sale," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 19(2), pages 243-269.
    11. Subir Bose & Arup Daripa, 2007. "Optimal Sale: Auctions with a Buy-Now Option," Birkbeck Working Papers in Economics and Finance 0702, Birkbeck, Department of Economics, Mathematics & Statistics.
    12. Holt, Charles A, Jr, 1980. "Competitive Bidding for Contracts under Alternative Auction Procedures," Journal of Political Economy, University of Chicago Press, vol. 88(3), pages 433-445, June.
    13. Maskin, Eric S & Riley, John G, 1984. "Optimal Auctions with Risk Averse Buyers," Econometrica, Econometric Society, vol. 52(6), pages 1473-1518, November.
    Full references (including those not matched with items on IDEAS)

    More about this item

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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.

    We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.