(Auction Algorithms for Multiassignment Problems) Consider the following assignment problem, where it is possible to assign more than one object to a single person:
(b) Define a multiassignment S to be a set of pairs (i, j) ∈ A such that for each object j, there is at most one pair (i, j) in S. A multiassignment S and a pair (π, p) are said to satisfy -CS if
