Optimizing Multiple Performance Metrics with Deep GSP Auctions for E-commerce Advertising

• URL: http://arxiv.org/abs/2012.02930v2
• Date: Fri, 8 Jan 2021 08:27:49 GMT
• Title: Optimizing Multiple Performance Metrics with Deep GSP Auctions for E-commerce Advertising
• Authors: Zhilin Zhang, Xiangyu Liu, Zhenzhe Zheng, Chenrui Zhang, Miao Xu, Junwei Pan, Chuan Yu, Fan Wu, Jian Xu and Kun Gai
• Abstract summary: In e-commerce advertising, the ad platform usually relies on auction mechanisms to optimize different performance metrics, such as user experience, advertiser utility, and platform revenue. We propose a new mechanism called Deep GSP auction, which leverages deep learning to design new rank score functions within the celebrated GSP auction framework.
• Score: 28.343122250701498
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In e-commerce advertising, the ad platform usually relies on auction mechanisms to optimize different performance metrics, such as user experience, advertiser utility, and platform revenue. However, most of the state-of-the-art auction mechanisms only focus on optimizing a single performance metric, e.g., either social welfare or revenue, and are not suitable for e-commerce advertising with various, dynamic, difficult to estimate, and even conflicting performance metrics. In this paper, we propose a new mechanism called Deep GSP auction, which leverages deep learning to design new rank score functions within the celebrated GSP auction framework. These new rank score functions are implemented via deep neural network models under the constraints of monotone allocation and smooth transition. The requirement of monotone allocation ensures Deep GSP auction nice game theoretical properties, while the requirement of smooth transition guarantees the advertiser utilities would not fluctuate too much when the auction mechanism switches among candidate mechanisms to achieve different optimization objectives. We deployed the proposed mechanisms in a leading e-commerce ad platform and conducted comprehensive experimental evaluations with both offline simulations and online A/B tests. The results demonstrated the effectiveness of the Deep GSP auction compared to the state-of-the-art auction mechanisms.

Related papers

• Multi-attribute Auction-based Resource Allocation for Twins Migration in Vehicular Metaverses: A GPT-based DRL Approach [85.65587846913793]
  Vehicular Metaverses are developed to enhance the modern automotive industry with an immersive and safe experience among connected vehicles. We propose an attribute-aware auction-based mechanism to optimize resource allocation during VTs migration. We train a DDA auctioneer using a generative pre-trained transformer (GPT)-based deep reinforcement learning (DRL) algorithm to adjust the auction clocks efficiently.
  arXiv  Detail & Related papers  (2024-06-08T09:41:38Z)
• NMA: Neural Multi-slot Auctions with Externalities for Online Advertising [19.613777564235555]
  We propose novel auction mechanisms named Neural Multi-slot Auctions (NMA) to tackle the challenges. NMA obtains higher revenue with balanced social welfare than other existing auction mechanisms. We have successfully deployed NMA on Meituan food delivery platform.
  arXiv  Detail & Related papers  (2022-05-20T08:21:59Z)
• A Real-World Implementation of Unbiased Lift-based Bidding System [8.35120274877627]
  A typical Demand-Side Platform (DSP)bids based on the predicted probability of click and conversion right after an ad impression. Recent studies find such a strategy is suboptimal and propose a better bidding strategy named lift-based bidding. Lift-based bidding simply bids the price according to the lift effect of the ad impression and achieves target metrics such as sales.
  arXiv  Detail & Related papers  (2022-02-23T01:15:54Z)
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising [53.636153252400945]
  We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies. Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
  arXiv  Detail & Related papers  (2021-06-11T08:07:14Z)
• Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertising [42.7415188090209]
  We develop deep models to efficiently extract contexts from auctions, providing rich features for auction design. DNAs have been successfully deployed in the e-commerce advertising system at Taobao.
  arXiv  Detail & Related papers  (2021-06-07T13:20:40Z)
• A novel auction system for selecting advertisements in Real-Time bidding [68.8204255655161]
  Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. We propose an alternative betting system with a new approach that not only considers the economic aspect but also other relevant factors for the functioning of the advertising system.
  arXiv  Detail & Related papers  (2020-10-22T18:36:41Z)
• Bid Shading in The Brave New World of First-Price Auctions [10.437496902575784]
  Bid shading is a known technique for preventing overpaying in auction systems. We propose a machine learning approach of modeling optimal bid shading for non-censored online first-price ad auctions.
  arXiv  Detail & Related papers  (2020-09-02T21:48:21Z)
• Certifying Strategyproof Auction Networks [53.37051312298459]
  We focus on the RegretNet architecture, which can represent auctions with arbitrary numbers of items and participants. We propose ways to explicitly verify strategyproofness under a particular valuation profile using techniques from the neural network verification literature.
  arXiv  Detail & Related papers  (2020-06-15T20:22:48Z)
• Reserve Price Optimization for First Price Auctions [14.18752189817994]
  We propose a gradient-based algorithm to adaptively update and optimize reserve prices based on estimates of bidders' responsiveness to experimental shocks in reserves. We show that revenue in a first-price auction can be usefully decomposed into a emphdemand component and a emphbidding component, and introduce techniques to reduce the variance of each component.
  arXiv  Detail & Related papers  (2020-06-11T15:35:19Z)
• MoTiAC: Multi-Objective Actor-Critics for Real-Time Bidding [47.555870679348416]
  We propose a Multi-ecTive Actor-Critics algorithm named MoTiAC for the problem of bidding optimization with various goals. Unlike previous RL models, the proposed MoTiAC can simultaneously fulfill multi-objective tasks in complicated bidding environments.
  arXiv  Detail & Related papers  (2020-02-18T07:16:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.