Assignment Algorithm [Resources to tasks]

I was hoping someone could direct me to a decent explanation and preferably implementation of an assignment algorithm (probably something like a special case of the Hungarian Algorithm) that would satisfy the following scenario: A team has x sensors. The sensors currently have y contacts. The penalty (as opposed to cost as per the usual scenario) for NOT maintaining a contact is f(contact). Each sensor can maintain a single contact automatically once detected but all others run a risk of being lost. The algorithm is required to assign the automatic single contact for each sensor. The values of x and y need not be equal, which (afaik) means the normal version of the Hungarian Algorithm is not appropriate and that several versions may be appropriate for say xy. Anyone familiar with this issue? [Edited by - playtime on March 14, 2008 12:03:03 PM]