In set system auctions, a single buyer needs to purchase services from multiple competing providers, and the set of providers has a combinatorial structure; a popular example is provided by shortest path auctions [1, 7]. In [3] it has been observed that if such an auction is conducted using first-price rules, then, counterintuitively, the buyer’s payment may go down if some of the sellers are p...