Competitive Generalized Auctions

Abstract

We describe mechanisms for auctions that are simultaneously truthful (alternately known as strategy-proof or incentive-compatible) and guarantee high "net" profit. We make use of appropriate variants of competitive analysis of algorithms in designing and analyzing our mechanisms. Thus, we do not require any probabilistic assumptions on bids. We presen