Show item record

dc.contributor.authorEhlers, Lars
dc.date.accessioned2006-09-22T19:56:49Z
dc.date.available2006-09-22T19:56:49Z
dc.date.issued2006
dc.identifier.citationEHLERS, Lars, «Respecting Priorities when Assigning Students to Schools», Cahier de recherche #2006-04, Département de sciences économiques, Université de Montréal, 2006, 25 pages.fr
dc.identifier.urihttp://hdl.handle.net/1866/555
dc.format.extent245377 bytes
dc.format.mimetypeapplication/pdf
dc.publisherUniversité de Montréal. Département de sciences économiques.fr
dc.subjectSchool Choice
dc.subjectEqual Priority
dc.subjectTie Breaking
dc.titleRespecting Priorities when Assigning Students to Schools
dc.typeArticle
dcterms.abstractWe 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.bibliographicCitationCahier de recherche ; #2006-04
dcterms.isPartOfurn:ISSN:0709-9231
UdeM.VersionRioxxVersion publiée / Version of Record


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show item record