The optimization of bidding strategies for online advertising slot auctions presents a critical challenge across numerous digital marketplaces. A significant obstacle to the development, evaluation, and refinement of real-time autobidding algorithms is the scarcity of comprehensive datasets and standardized benchmarks.To address this deficiency, we present an auction benchmark encompassing the two most prevalent auction formats. We implement a series of robust baselines on a novel dataset, addressing the most salient Real-Time Bidding (RTB) problem domains: budget pacing uniformity and Cost Per Click (CPC) constraint optimization. This benchmark provides a user-friendly and intuitive framework for researchers and practitioners to develop and refine innovative autobidding algorithms, thereby facilitating advancements in the field of programmatic advertising. The implementation and additional resources can be accessed at the following repository (this https URL,this https URL).
View on arXiv@article{khirianova2025_2505.08485,
title={ BAT: Benchmark for Auto-bidding Task },
author={ Alexandra Khirianova and Ekaterina Solodneva and Andrey Pudovikov and Sergey Osokin and Egor Samosvat and Yuriy Dorn and Alexander Ledovsky and Yana Zenkova },
journal={arXiv preprint arXiv:2505.08485},
year={ 2025 }
}