mlsanityData to 7 Oct 2026

NMA: Neural Multi-slot Auctions with Externalities for Online Advertising

arXiv 2205.10018 ↗First posted 20 May 2022cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 15 of its 41 references that are in the map. First posted on arXiv 20 May 2022.

Builds on

15 of 41 references.

References · 15

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  4. 2019Stochastic Optimization of Sorting Networks via Continuous Relaxationscited by 111
  5. 2021Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertisingcited by 31
  6. 2022Disentangling Long and Short-Term Interests for Recommendationcited by 22
  7. 2021Cross DQN: Cross Deep Q Network for Ads Allocation in Feedcited by 18
  8. 2020Optimizing Multiple Performance Metrics with Deep GSP Auctions for E-commerce Advertisingcited by 13
  9. 2021Deep Position-wise Interaction Network for CTR Predictioncited by 8
  10. 2014Optimising Trade-offs Among Stakeholders in Ad Auctionscited by 4
  11. 2021On Designing a Two-stage Auction for Online Advertisingcited by 4
  12. 2022Learn over Past, Evolve for Future: Search-based Time-aware Recommendation with Sequential Behavior Datacited by 3
3 more
  1. 2014Truthful Learning Mechanisms for Multi-Slot Sponsored Search Auctions with Externalitiescited by 2
  2. 2015Ad auctions and cascade model: GSP inefficiency and algorithmscited by 2
  3. 2016Towards Better Models of Externalities in Sponsored Search Auctionscited by 2

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 1; 2025: 1.

4 papers.