Toggle Main Menu Toggle Search

ePrints

Assignment Using Choice Lists

Lookup NU author(s):

Downloads

Full text is not currently available for this publication.


Abstract

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.


Publication metadata

Author(s): Wilson LB

Publication type: Report

Series Title: Computing Laboratory Technical Report Series

Year: 1975

Pages: 18

Source Publication Date: October 1975

Report Number: 82

Institution: Computing Laboratory, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/82.pdf


Share