Optimal discounts for the online assignment problem

We prove that, for two simple functions drltdrlt, solving the online assignment problem with crl−drltcrl−drlt as the contribution for assigning resource rr to task ll at time tt gives the optimal solution to the corresponding offline assignment problem (provided the optimal offline solution is unique). We call such functions drltdrltoptimal discount functions.