Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgets
Authors: Yurong Chen, Qian Wang, Zhijian Duan, Haoran Sun, Zhaohua Chen, Xiang Yan, Xiaotie Deng
ICML 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | The performance of our algorithms is further evaluated by experiments on both synthetic and real data. |
| Researcher Affiliation | Collaboration | 1Center on Frontiers of Computing Studies, School of Computer Science, Peking University, Beijing, China 3Huawei TCS Lab, Shanghai, China |
| Pseudocode | Yes | Algorithm 1 Coordinated Pacing (CP) |
| Open Source Code | No | The paper does not explicitly state that source code for its methodology is made publicly available, nor does it provide a link to a code repository. |
| Open Datasets | Yes | The real-world data we use, the i Pin You dataset 1 (Liao et al., 2014; Zhang et al., 2014), was provided for a real-time bidding competition organized by i Pin You. |
| Dataset Splits | No | The paper mentions using 'testing data' but does not provide specific details on validation dataset splits, such as percentages, absolute counts, or predefined partition methodologies. |
| Hardware Specification | No | The paper does not provide specific details about the hardware used to run the experiments, such as CPU or GPU models, or memory specifications. |
| Software Dependencies | No | The paper does not specify the version numbers of any software dependencies, such as programming languages, libraries, or frameworks used in the experiments. |
| Experiment Setup | Yes | We set the initial multipliers and their upper bounds as 1.0 and 20.0, respectively. We take step size ϵ = 0.1T 0.5 and T = 20, 000. |