paper

Bat: Benchmark for auto-bidding task

Aleksandra Khirianova, Ekaterina Solodneva, Andrey Pudovikov, Sergey Osokin, Egor Samosvat, Yuriy Dorn, Alexander Ledovsky, Yana Zenkova

PaperarXiv:2505.08485GitHubHuggingFaceZenodo

Cite this publication

Bat: Benchmark for auto-bidding task

@inproceedings{khirianova2025-bat,
  title     = {Bat: Benchmark for auto-bidding task},
  author    = {Aleksandra Khirianova and Ekaterina Solodneva and Andrey Pudovikov and Sergey Osokin and Egor Samosvat and Yuriy Dorn and Alexander Ledovsky and Yana Zenkova},
  year      = {2025},
  booktitle = {Proceedings of the ACM on Web Conference 2025},
  doi       = {10.1145/3696410.3714657},
  eprint    = {2505.08485},
  archivePrefix = {arXiv},
  url       = {https://arxiv.org/abs/2505.08485}
}

Download .bib

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.