Recall the matching problem we saw in class: there are n gifts, and n children, and each child has a non-negative valuation for each gift. Formally, the value of gift j to child i is given by Hi- We assume that all Hij 2 0. Santa's goal is to give one gift to each child, so as to maximize the total value (of course, a gift cannot be given to more than one child). Recall the matching problem we saw in class: there are n gifts, and n children, and each child has a non-negative valuation for each gift. Formally, the value of gift j to child i is given by Hi- We assume that all Hij 2 0. Santa's goal is to give one gift to each child, so as to maximize the total value (of course, a gift cannot be given to more than one child)