(Using the Third Best Value in the Auction Algorithm) Frequently in the auction algorithm the two best objects for a given person do not change between two successive bids of that person. This exercise develops an implementation idea that attempts to exploit this fact by using a test to check whether the two best objects from the preceding bid continue to be best. If the test is passed, the computation of the values aij - pj of the remaining objects is unnecessary.
