Assignment Using Choice Lists

  1. Lookup NU author(s)
Author(s)Wilson LB
Publication type Report
Series TitleComputing Laboratory Technical Report Series
Source Publication DateOctober 1975
Report Number82
Full text is not currently available for this publication.
This paper examines the problem of assigning items to people given that each person lists the items in order in which he would prefer them. Three types of assignment function are examined namely stable, bottleneck and numerical and the advantages and disadvantages of each are discussed. The effect of allowing equal choices in the lists (weak preference ordering) is also examined.
InstitutionComputing Laboratory, University of Newcastle upon Tyne
Place PublishedNewcastle upon Tyne
ActionsLink to this publication