Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.19357 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918165541289984 |
|---|---|
| author | Pudovikov, Andrey Khirianova, Alexandra Solodneva, Ekaterina Katrutsa, Aleksandr Samosvat, Egor Dorn, Yuriy |
| author_facet | Pudovikov, Andrey Khirianova, Alexandra Solodneva, Ekaterina Katrutsa, Aleksandr Samosvat, Egor Dorn, Yuriy |
| contents | Advertisement auctions play a crucial role in revenue generation for e-commerce companies. To make the bidding procedure scalable to thousands of auctions, the automatic bidding (autobidding) algorithms are actively developed in the industry. Therefore, the fair and reproducible evaluation of autobidding algorithms is an important problem. We present a standardized and transparent evaluation protocol for comparing classical and reinforcement learning (RL) autobidding algorithms. We consider the most efficient autobidding algorithms from different classes, e.g., ones based on the controllers, RL, optimal formulas, etc., and benchmark them in the bidding environment. We utilize the most recent open-source environment developed in the industry, which accurately emulates the bidding process. Our work demonstrates the most promising use cases for the considered autobidding algorithms, highlights their surprising drawbacks, and evaluates them according to multiple metrics. We select the evaluation metrics that illustrate the performance of the autobidding algorithms, the corresponding costs, and track the budget pacing. Such a choice of metrics makes our results applicable to the broad range of platforms where autobidding is effective. The presented comparison results help practitioners to evaluate the candidate autobidding algorithms from different perspectives and select ones that are efficient according to their companies' targets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_19357 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms Pudovikov, Andrey Khirianova, Alexandra Solodneva, Ekaterina Katrutsa, Aleksandr Samosvat, Egor Dorn, Yuriy Computer Science and Game Theory Machine Learning Advertisement auctions play a crucial role in revenue generation for e-commerce companies. To make the bidding procedure scalable to thousands of auctions, the automatic bidding (autobidding) algorithms are actively developed in the industry. Therefore, the fair and reproducible evaluation of autobidding algorithms is an important problem. We present a standardized and transparent evaluation protocol for comparing classical and reinforcement learning (RL) autobidding algorithms. We consider the most efficient autobidding algorithms from different classes, e.g., ones based on the controllers, RL, optimal formulas, etc., and benchmark them in the bidding environment. We utilize the most recent open-source environment developed in the industry, which accurately emulates the bidding process. Our work demonstrates the most promising use cases for the considered autobidding algorithms, highlights their surprising drawbacks, and evaluates them according to multiple metrics. We select the evaluation metrics that illustrate the performance of the autobidding algorithms, the corresponding costs, and track the budget pacing. Such a choice of metrics makes our results applicable to the broad range of platforms where autobidding is effective. The presented comparison results help practitioners to evaluate the candidate autobidding algorithms from different perspectives and select ones that are efficient according to their companies' targets. |
| title | Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms |
| topic | Computer Science and Game Theory Machine Learning |
| url | https://arxiv.org/abs/2510.19357 |