REVIEW 4 cited by
NMA: Neural Multi-slot Auctions with Externalities for Online Advertising
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Online advertising driven by auctions brings billions of dollars in revenue for social networking services and e-commerce platforms. GSP auctions, which are simple and easy to understand for advertisers, have almost become the benchmark for ad auction mechanisms in the industry. However, most GSP-based industrial practices assume that the user click only relies on the ad itself, which overlook the effect of external items, referred to as externalities. Recently, DNA has attempted to upgrade GSP with deep neural networks and models local externalities to some extent. However, it only considers set-level contexts from auctions and ignores the order and displayed position of ads, which is still suboptimal. Although VCG-based multi-slot auctions (e.g., VCG, WVCG) make it theoretically possible to model global externalities (e.g., the order and positions of ads and so on), they lack an efficient balance of both revenue and social welfare. In this paper, we propose novel auction mechanisms named Neural Multi-slot Auctions (NMA) to tackle the above-mentioned challenges. Specifically, we model the global externalities effectively with a context-aware list-wise prediction module to achieve better performance. We design a list-wise deep rank module to guarantee incentive compatibility in end-to-end learning. Furthermore, we propose an auxiliary loss for social welfare to effectively reduce the decline of social welfare while maximizing revenue. Experiment results on both offline large-scale datasets and online A/B tests demonstrate that NMA obtains higher revenue with balanced social welfare than other existing auction mechanisms (i.e., GSP, DNA, WVCG) in industrial practice, and we have successfully deployed NMA on Meituan food delivery platform.
Forward citations
Cited by 4 Pith papers
-
Optimal Auction Design in the Joint Advertising
An optimal Myerson-style auction is identified for single-slot joint advertising, and a neural network named BundleNet approximates it in single-slot tests and outperforms two existing baselines in most multi-slot tests.
-
Deterministic-Allocation and Anonymous Joint Advertising in E-commerce Platforms
JTransNet is a transformer-based neural auction architecture that produces deterministic, anonymous, near-DSIC joint ad mechanisms and outperforms VCG, JAMA, and RegretNet on revenue in the paper's experiments.
-
NGA: Non-autoregressive Generative Auction with Global Externalities for Advertising Systems
NGA is a non-autoregressive generative auction that models effects of adjacent organic content and computes rewards and payments in parallel, reporting gains in RPM, CTR, CVR, and latency over CGA.
-
EGA-V2: An End-to-end Generative Framework for Industrial Advertising
EGA-V2 unifies ad ranking, creative selection, allocation, and payment into one generative transformer, and reports offline revenue and CTR improvements over cascaded and generative baselines on Meituan data.
Discussion (0). Continue with ORCID to comment.