paper-with-me

홈 › Papers

Calibrated Click-Through Auctions: An Information Design Approach

2021-05-19 · Dirk Bergemann, Paul Duetting, Renato Paes Leme, Song Zuo

We analyze the optimal information design in a click-through auction with fixed valuations per click, but stochastic click-through rates. While the auctioneer takes as given the auction rule of the click-through auction, namely the generalized second-price auction, the auctioneer can design the information flow regarding the click-through rates among the bidders. A natural requirement in this context is to ask for the information structure to be calibrated in the learning sense. With this constraint, the auction needs to rank the ads by a product of the bid and an unbiased estimator of the click-through rates, and the task of designing an optimal information structure is thus reduced to the task of designing an optimal unbiased estimator. We show that in a symmetric setting with uncertainty about the click-through rates, the optimal information structure attains both social efficiency and surplus extraction. The optimal information structure requires private (rather than public) signals to the bidders. It also requires correlated (rather than independent) signals, even when the underlying uncertainty regarding the click-through rates is independent. Beyond symmetric settings, we show that the optimal information structure requires partial information disclosure.

📄 PDF Abstract BibTeX arXiv:2105.09375

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Designing Truthful Contextual Multi-Armed Bandits based Sponsored Search Auctions

2020-02-26 · Kumar Abhishek, Shweta Jain, Sujit Gujar

For sponsored search auctions, we consider contextual multi-armed bandit problem in the presence of strategic agents. In this setting, at each round, an advertising platform (center) runs an auction to select the best-su…

Multi-Armed Bandits

Pairwise Ranking Losses of Click-Through Rates Prediction for Welfare Maximization in Ad Auctions

2023-06-01 · Boxiang Lyu, Zhe Feng, Zachary Robertson, Sanmi Koyejo

We study the design of loss functions for click-through rates (CTR) to optimize (social) welfare in advertising auctions. Existing works either only focus on CTR predictions without consideration of business objectives (…

Learning-To-Rank

Dimensionality reduction for click-through rate prediction: Dense versus sparse representation

2013-11-27 · Bjarne Ørum Fruergaard, Toke Jansen Hansen, Lars Kai Hansen

In online advertising, display ads are increasingly being placed based on real-time auctions where the advertiser who wins gets to serve the ad. This is called real-time bidding (RTB). In RTB, auctions have very tight ti…

Click-Through Rate PredictionDimensionality Reduction

Improved Online Learning Algorithms for CTR Prediction in Ad Auctions

2024-02-29 · Zhe Feng, Christopher Liaw, Zixin Zhou

In this work, we investigate the online learning problem of revenue maximization in ad auctions, where the seller needs to learn the click-through rates (CTRs) of each ad candidate and charge the price of the winner thro…

Click-Through Rate Prediction

Contingent Fees in Order Flow Auctions

2023-04-11 · Max Resnick

Many early order flow auction designs handle the payment for orders when they execute on the chain rather than when they are won in the auction. Payments in these auctions only take place when the orders are executed, cr…