- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper estimates advertiser value distributions from strategic GSP bids using Bernstein CDFs, a SODA equilibrium simulator, Wasserstein matching, and BO-assisted SMC-ABC. Its central motivation is portability to auction mechanisms where analytical inversion is difficult or unavailable.
Critical strengths
1.Well-motivated problem and appropriately modest positioning against specialized estimators.
2.Explicit discussion of approximation errors and assumptions required for convergence.
3.Lower average distributional error than KimPal in the reported uniform/beta simulations.
Critical weaknesses
1.Insufficient literature positioning and an overgeneralized identification claim. BOLFI [1] and the related auction-estimation work by Ewert & Bichler [2] are not discussed. Positioning the proposed framework relative to these works would help clarify its incremental contribution. Additionally, the introduction’s claim that generalized or unobserved scoring rules make primitives “fundamentally unidentified” needs qualification: Laffont et al. (2020), Econometrics of Scoring Auctions, provides identification results under stated assumptions. The paper should distinguish the absence of a tractable analytical inversion from non-identification. A simulation-based estimator does not by itself resolve the latter, and Section 4 appropriately treats identification as a maintained condition.
2.The central portability claim lacks direct experimental validation. The experiments vary distributions and auction parameters within GSP settings, but do not demonstrate recovery under a mechanism explicitly identified as lacking an available analytical inversion. The comparisons establish performance in benchmark environments, rather than the claimed advantage when mechanism-specific inversion is unavailable. A recovery experiment under such a mechanism would directly support the paper’s central motivation; outperforming KimPal in its applicable settings is not necessary.
3.Lab-model compatibility remains insufficiently documented. Bae & Kagel’s dataset includes both static complete-information and dynamic incomplete-information auctions, with valuation draws subject to ratio constraints. Section 5.2 does not specify which information treatments and bidding rounds enter estimation, or how the constrained value-generation process is reconciled with the model’s independence assumption. The information structure and within-auction feedback also require justification for interpreting these observations through a static symmetric BNE model. Although Section 3 acknowledges possible equilibrium nonexistence and states that recovered strategies satisfy the maintained restriction, treatment-specific evidence supporting equilibrium validity is not reported. These gaps limit the interpretation of the lab results as structural recovery, rather than distributional fit under a potentially misspecified behavioral model.
[1] Michael U. Gutmann and Jukka Corander. Bayesian Optimization for Likelihood-Free Inference of Simulator-Based Statistical Models. JMLR, 17(125):1–47, 2016. Official record [2] Markus Ewert and Martin Bichler. Structural Estimation of Auction Data through Equilibrium Learning and Optimal Transport. WI 2025 conference contribution. Official conference program
Questions for authors
See the weakness
Thank you for your constructive review.
W1a: Related work. BOLFI (Gutmann & Corander, 2016) uses a Gaussian-process surrogate to guide simulations and approximate the likelihood-free posterior. BOSMC instead uses a surrogate to reject selected SMC-ABC proposals before costly equilibrium simulation; proposals passing this screening are evaluated using their simulated rather than surrogate-predicted discrepancies. Importantly, this screening changes the effective proposal distribution. Without accounting for it in the weighting scheme, the resulting particles need not target the same ABC posterior as standard SMC-ABC. We therefore do not claim that BOSMC preserves the exact SMC-ABC guarantees. Screening trades computational savings against possible approximation bias. We will clarify the screening rule and its limitations.
Ewert & Bichler (2025) also combine equilibrium learning and optimal transport with a GPV-style estimation framework. The distinction is not the use of equilibrium computation or Wasserstein distance per se, but the role of inversion: their method refines a two-step inversion-based estimator, whereas ours matches bids generated by forward equilibrium simulation without implementing a mechanism-specific inverse mapping. We will clarify this relationship.
W1b: Identification vs. inversion. We agree that our introduction conflates these issues. Laffont et al. (2020) establish identification under specified assumptions; our text should not suggest that the absence of a tractable inversion formula implies non-identification. Simulation does not create identification, but can exploit it without explicitly implementing an inverse.
For our symmetric IPV GSP benchmark with known CTRs, linear scoring, and a strictly increasing symmetric BNE, identification follows from the equilibrium first-order condition under suitable regularity assumptions. It yields v=ξ(b;G), where G is the bid distribution (Kim & Pal, 2025). If F1 and F2 generated the same G under these restrictions, then F1(ξ(b;G))=G(b)=F2(ξ(b;G)) on the relevant support, implying F1=F2. With fixed Bernstein degree and support, an injective coefficient representation likewise identifies θ. We will state these assumptions explicitly. A platform knows its own scoring rule, but that knowledge alone does not ensure identification in more general mechanisms; identification must be assessed separately from tractability.
W2: Portability. We agree that an experiment on a mechanism without an available analytical inversion would most directly validate the motivating application, and that our current experiments do not establish this empirically. Instead, they demonstrate recovery in benchmark environments where comparison with a specialized estimator is possible. Portability is an architectural feature: the forward-simulation estimation procedure can be retained while adapting the equilibrium simulator and any mechanism-specific model components, subject to identification and suitable equilibrium computation. We will narrow the corresponding claims.
W3: Laboratory data. Thank you for identifying missing details. We use the dynamic incomplete-information treatments with CTRs 11-10 and 11-3, each comprising three groups. Within each group, we pool bidding rounds (960–1,920 value–bid observations per group, 8,624 in total), estimate a symmetric three-bidder model separately, and report treatment-level means and standard deviations across groups in Table 3. We will document these choices in Section 5.2.
The ratio restriction in Bae & Kagel (2019) applies to the static complete-information auctions, not the dynamic incomplete-information treatments we use. In the latter, values are independently drawn from [1,100], consistent with the IPV specification. We agree, however, that repeated bidding and within-auction feedback may induce learning and dependence in bids, which our static BNE model does not explicitly represent.
Equilibrium behavior is a maintained assumption of structural auction estimation, but verifying that SODA computes an approximate equilibrium for candidate primitives does not establish that human subjects play that equilibrium. The laboratory setting offers a valuable ground-truth evaluation: values are observed by the experimenter but withheld from estimation, so Table 3 measures recovery accuracy when an equilibrium-based estimator is applied to human bids. We interpret this as evidence of empirical recovery under a potentially imperfect behavioral approximation, not proof of equilibrium play. A comparison using later rounds only would directly assess sensitivity to learning. We will soften the claim of recovery “regardless of slot-quality decay,” given the higher errors under 11-10.