We study students placement in Egyptian colleges under the current demand/supply placement mechanism implemented in Egypt (e-mechanism). We show that the e-mechanism is not Pareto efficient nor strategy proof and, moreover, it can not be improved to accommodate Pareto efficiency nor strategy proofness. The final conclusion is that it is better, from an efficiency point of view, to adopt a matching algorithm, like the Gale-Shapley mechanism, in students placement.
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.
Publisher Info
Paper provided by University Library of Munich, Germany in its series MPRA Paper with number
17596.
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
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Roth, Alvin E. & Sotomayor, Marilda, 1992.
"Two-sided matching,"
Handbook of Game Theory with Economic Applications,
in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541
Elsevier.
[Downloadable!] (restricted)