This repository contains the benchmark implementation and supplementary materials for our paper "Title" (link). It provides a comprehensive framework for evaluating and comparing different bidding strategies in online advertising auctions.
- Implementation of the following bidding strategies:
- Simulation environment for ad auctions of two types: FPA (First-Price Auction) and VCG (Vickrey–Clarke–Groves) auction
- Data analysis and visualization tools
- Benchmark datasets
.
├── 📜 LICENSE
├── 📘 README.md
├── 📊 data/ # Data for VCG and FPA (to be downloaded with dvc)
│ ├── fpa/
│ ├── vcg/
├── 📓 example_notebooks/ # Notebooks with model running examples
│ ├── baseline_bidders.ipynb # Guideline: how to make experiments with bidders
│ ├── bidder_example.ipynb # Guideline: how to create new bidder class
│ └── 📊 best_params/
├── 📋 requirements.txt
├── 🛠️ simulator/ # Main simulator code
│ ├── 💰 model/ # Bidder models
│ │ ├── bidder.py # Parent class for all bidders
│ │ ├── broi_bidder.py
│ │ ├── linear_bidder.py # ALM bidder implementation
│ │ ├── m_pid.py
│ │ ├── mystique.py
│ │ ├── ta_pid.py
│ │ └── traffic.py
│ ├── 🔄 simulation/ # Modules for running simulations
│ │ ├── modules.py
│ │ ├── simulate.py
│ │ ├── utils.py
│ │ └── utils_visualization.py
│ └── ✅ validation/ # Running experiments on all campaigns
│ ├── check_results.py
│ └── metrics.py
└── 📔 useful_notebooks/ # Notebooks with data filtering examples
├── filter-fpa.ipynb
└── filter-vcg.ipynb
- Clone the repository:
git clone https://github.com/avito/your-repo-name.git
- Install the required packages:
pip install -r requirements.txt
- Download data:
dvc pull
The Sum Click Ratio (SCR) for the proposed models:
Model | SCRVCG | SCRFP |
---|---|---|
ALM | 662,466 | 1,085,836 |
TA-PID | 909,282 | 1,478,538 |
M-PID | 889,251 | 1,240,244 |
Mystique | 932,152 | 1,073,291 |
BROI | 495,169 | 1,098,184 |
We welcome contributions to improve the benchmark. Please feel free to submit issues or pull requests.
If you use this benchmark in your research, please cite our paper: to be updated
This project is licensed under MIT License. See the LICENSE file for details.