Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
We introduce a study of position auctions, with an explicit modeling of user navigation through ads. We refer to our model as the PPA model, since it is most applicable in the con...
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...