Assignment Using Choice Lists

This paper examines the problem of assigning items to people, given that each person lists the items in the 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.