Respecting Priorities when Assigning Students to Schools
dc.contributor.author | Ehlers, Lars | |
dc.date.accessioned | 2006-09-22T19:56:49Z | |
dc.date.available | 2006-09-22T19:56:49Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://hdl.handle.net/1866/555 | |
dc.format.extent | 245377 bytes | |
dc.format.mimetype | application/pdf | |
dc.publisher | Université de Montréal. Département de sciences économiques. | fr |
dc.subject | School Choice | |
dc.subject | Equal Priority | |
dc.subject | Tie Breaking | |
dc.title | Respecting Priorities when Assigning Students to Schools | |
dc.type | Article | |
dc.contributor.affiliation | Université de Montréal. Faculté des arts et des sciences. Département de sciences économiques | |
dcterms.abstract | We consider the problem of assigning students to schools on the basis of priorities. Students are allowed to have equal priority at a school. We characterize the efficient rules which weakly/strongly respect students’ priorities. When priority orderings are not strict, it is not possible to simply break ties in a fixed manner. All possibilities of resolving the indifferences need to be considered. Neither the deferred acceptance algorithm nor the top trading cycle algorithm successfully solve the problem of efficiently assigning the students to schools whereas a modified version of the deferred acceptance algorithm might. In this version tie breaking depends on students’ preferences. | |
dcterms.isPartOf | urn:ISSN:0709-9231 | |
UdeM.VersionRioxx | Version publiée / Version of Record | |
oaire.citationTitle | Cahier de recherche | |
oaire.citationIssue | 2006-04 |
Files in this item
This item appears in the following Collection(s)
This document disseminated on Papyrus is the exclusive property of the copyright holders and is protected by the Copyright Act (R.S.C. 1985, c. C-42). It may be used for fair dealing and non-commercial purposes, for private study or research, criticism and review as provided by law. For any other use, written authorization from the copyright holders is required.