AuctionNet: A Novel Benchmark for Decision-Making in Large-Scale Games
- URL: http://arxiv.org/abs/2412.10798v2
- Date: Sat, 28 Dec 2024 08:30:51 GMT
- Title: AuctionNet: A Novel Benchmark for Decision-Making in Large-Scale Games
- Authors: Kefan Su, Yusen Huo, Zhilin Zhang, Shuai Dou, Chuan Yu, Jian Xu, Zongqing Lu, Bo Zheng,
- Abstract summary: AuctionNet is a benchmark for bid decision-making in large-scale ad auctions.
The environment effectively replicates the integrity and complexity of real-world ad auctions.
The dataset contains 10 million ad opportunities, 48 diverse auto-bidding agents, and over 500 million auction records.
- Score: 44.97123065385426
- License:
- Abstract: Decision-making in large-scale games is an essential research area in artificial intelligence (AI) with significant real-world impact. However, the limited access to realistic large-scale game environments has hindered research progress in this area. In this paper, we present AuctionNet, a benchmark for bid decision-making in large-scale ad auctions derived from a real-world online advertising platform. AuctionNet is composed of three parts: an ad auction environment, a pre-generated dataset based on the environment, and performance evaluations of several baseline bid decision-making algorithms. More specifically, the environment effectively replicates the integrity and complexity of real-world ad auctions through the interaction of several modules: the ad opportunity generation module employs deep generative networks to bridge the gap between simulated and real-world data while mitigating the risk of sensitive data exposure; the bidding module implements diverse auto-bidding agents trained with different decision-making algorithms; and the auction module is anchored in the classic Generalized Second Price (GSP) auction but also allows for customization of auction mechanisms as needed. To facilitate research and provide insights into the environment, we have also pre-generated a substantial dataset based on the environment. The dataset contains 10 million ad opportunities, 48 diverse auto-bidding agents, and over 500 million auction records. Performance evaluations of baseline algorithms such as linear programming, reinforcement learning, and generative models for bid decision-making are also presented as a part of AuctionNet. We believe that AuctionNet is applicable not only to research on bid decision-making in ad auctions but also to the general area of decision-making in large-scale games.
Related papers
- Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs.
Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
arXiv Detail & Related papers (2024-11-20T18:06:55Z) - Revisiting the Domain Shift and Sample Uncertainty in Multi-source
Active Domain Transfer [69.82229895838577]
Active Domain Adaptation (ADA) aims to maximally boost model adaptation in a new target domain by actively selecting a limited number of target data to annotate.
This setting neglects the more practical scenario where training data are collected from multiple sources.
This motivates us to target a new and challenging setting of knowledge transfer that extends ADA from a single source domain to multiple source domains.
arXiv Detail & Related papers (2023-11-21T13:12:21Z) - Towards Real-World Prohibited Item Detection: A Large-Scale X-ray
Benchmark [53.9819155669618]
This paper presents a large-scale dataset, named as PIDray, which covers various cases in real-world scenarios for prohibited item detection.
With an intensive amount of effort, our dataset contains $12$ categories of prohibited items in $47,677$ X-ray images with high-quality annotated segmentation masks and bounding boxes.
The proposed method performs favorably against the state-of-the-art methods, especially for detecting the deliberately hidden items.
arXiv Detail & Related papers (2021-08-16T11:14:16Z) - Bidding via Clustering Ads Intentions: an Efficient Search Engine
Marketing System for E-commerce [13.601308818833301]
This paper introduces the end-to-end structure of the bidding system for search engine marketing for Walmart e-commerce.
We exploit the natural language signals from the users' query and the contextual knowledge from the products to mitigate the sparsity issue.
We analyze the online and offline performances of our approach and discuss how we find it as a production-efficient solution.
arXiv Detail & Related papers (2021-06-24T00:12:07Z) - 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) - Optimizing Multiple Performance Metrics with Deep GSP Auctions for
E-commerce Advertising [28.343122250701498]
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.
arXiv Detail & Related papers (2020-12-05T02:51:11Z) - Real-Time Optimization Of Web Publisher RTB Revenues [10.908037452134302]
This paper describes an engine to optimize web publisher revenues from second-price auctions.
The engine is able to predict, for each auction, an optimal reserve price in approximately one millisecond.
arXiv Detail & Related papers (2020-06-12T11:14:56Z) - 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.