A Lower Bound on the Competitive Ratio of Truthful Auctions

We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an auction to that of an optimal single price sale to at least two bidders. In this framework, we give a lower bound of 2.42 (an improvement from the bound of 2 given in [2]) on the competitive ratio of any truthful auction, one where each bidders best strategy is to declare the true maximum value an item is worth to them. This result contrasts with the 3.39 competitive ratio of the best known truthful auction [3].

• Type: Conference
• Year: 2004
• Where: STACS
• Authors: Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks
• Keywords: Case Competitive Framework, Competitive Ratio, STACS 2004, Theoretical Computer Science, Truthful Auction