Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142890 | Operations Research Letters | 2010 | 6 Pages |
Abstract
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-as-you-bid pricing scheme. In this paper, we study the query allocation problem where the ad space is priced using the well-known and widely used generalized second-price (GSP) scheme. We observe that the previous algorithms fail to achieve a bounded competitive ratio under the GSP scheme. On the positive side, we present online constant-competitive algorithms for the problem.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi,