New interface

# Truthful Learning Mechanisms for Multi–Slot Sponsored Search Auctions with Externalities

3 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : Sponsored Search Auctions (SSAs) constitute one of the most successful applications of microeconomic mechanisms. In mechanism design, auctions are usually designed to incentivize advertisers to bid their truthful valuations and, at the same time, to guarantee both the advertisers and the auctioneer a non–negative utility. Nonetheless, in sponsored search auctions, the Click–Through–Rates (CTRs) of the advertisers are often unknown to the auctioneer and thus standard truthful mechanisms cannot be directly applied and must be paired with an effective learning algorithm for the estimation of the CTRs. This introduces the critical problem of designing a learning mechanism able to estimate the CTRs at the same time as implementing a truthful mechanism with a revenue loss as small as possible compared to the mechanism that can exploit the true CTRs. Previous work showed that, when dominant–strategy truthfulness is adopted, in single–slot auctions the problem can be solved using suitable exploration–exploitation mechanisms able to achieve a cumulative regret (on the auctioneer's revenue) of order $\overset{\sim}{O}(T^\frac{2}{3})$, where $T$ is the number of times the auction is repeated. It is also known that, when truthfulness in expectation is adopted, a cumulative regret (over the social welfare) of order $\overset{\sim}{O}(T^\frac{1}{2})$ can be obtained. In this paper, we extend the results available in the literature to the more realistic case of multi–slot auctions. In this case, a model of the user is needed to characterize how the CTR of an ad changes as its position in the allocation changes. In particular, we adopt the cascade model, one of the most popular models for sponsored search auctions, and we prove a number of novel upper bounds and lower bounds on both auctioneer’s revenue loss and social welfare w.r.t. to the Vickrey–Clarke–Groves (VCG) auction. Furthermore, we report numerical simulations investigating the accuracy of the bounds in predicting the dependency of the regret on the auction parameters.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [40 references]

https://hal.inria.fr/hal-01237670
Contributor : Alessandro Lazaric Connect in order to contact the contributor
Submitted on : Friday, December 4, 2015 - 3:44:16 PM
Last modification on : Tuesday, November 22, 2022 - 2:26:16 PM
Long-term archiving on: : Saturday, April 29, 2017 - 4:17:26 AM

### File

main.pdf
Files produced by the author(s)

### Citation

Nicola Gatti, Alessandro Lazaric, Marco Rocco, Francesco Trovò. Truthful Learning Mechanisms for Multi–Slot Sponsored Search Auctions with Externalities. Artificial Intelligence, 2015, 227, pp.93-139. ⟨10.1016/j.artint.2015.05.012⟩. ⟨hal-01237670⟩

Record views