- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper identifies four major pathologies of existing bidding agents and proposes a new bidding agent design with theoretical guarantees. Across multiple datasets, the proposed method achieves significant improvements over several baselines.
Critical strengths
The paper designs a bidding agent with theoretical guarantees and achieves substantial improvements over the baselines across multiple datasets.
Critical weaknesses
The paper's writing needs substantial improvement, as the current presentation is rather disorganized and lacks a clear focus. Surprisingly, all the important theoretical results are placed in the appendix and should be moved to the main text. A thorough rewrite of the paper seems necessary before publication.
The paper contains too many typos, for example, "Complete Mathematical Proofs of Theorems A.1, A.1, A.1, and Propositions 1–2."
Questions for authors
For the upper bound, can we obtain a corresponding lower bound?
Does the 0.42 ms latency account for processing multiple requests in parallel? In bidding scenarios, decisions often need to be made sequentially, such as updating the budget before placing the next bid. What would the latency be in this case?
Assumption (8) seems rather strong. The authors should conduct empirical tests on real-world datasets to examine whether this assumption holds in practice.