Generalized first-price auction
The generalized first-price auction (GFP) is a non-truthful auction mechanism for sponsored search using real-time bidding (a.k.a. position auctions). In sponsored search n bidders compete for the assignment of k slots. Each slot has an associate click-through rate, the click-through rates are decreasing from top to bottom. The GFP mechanism asks each bidder for a bid. Then the highest bidder gets the first slot, the second-highest, the second slot and so on. On each click the highest bidder pays his bid on the first slot, the second highest bidder pays his bid on the second slot, and so on.