(Auction Algorithms for Multiassignment Problems) Consider the following assignment problem, where it is possible to assign more than one object to a single person:
![](https://test.transtutors.com/qimg/1b0b9820-058b-401b-a7e5-a42965a05291.png)
(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
![](https://test.transtutors.com/qimg/eec73483-0576-4923-a2df-9dfdd4dc385c.png)