- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies how to estimate market-price distributions from auction logs when prices are revealed only after a win. It first explains what cannot be recovered, then uses the always-observed bids and a copula dependence model to correct the bias. Experiments on three benchmarks assess prediction and bidding performance.
Critical strengths
- The paper makes good use of the fact that bids are always observed. It characterizes the remaining uncertainty and explains which added conditions allow recovery of the price distribution. (pp. 3–5, Theorem 1)
- The evaluation covers hidden signals, misspecified distribution families, and bid replay. On AuctionNet, the overshoot above the target win rate falls from 17.8 to 7.9 percentage points, showing a benefit for downstream decisions. (p. 8, Table 3)
Critical weaknesses
- Reliability remains unclear when most prices are hidden and bids closely track prices. The guarantee covers finite models under regularity conditions, not the actual network. The main distribution-error metric stops at the 90th percentile of bids, and error still rises to 0.075 under strong dependence. (pp. 5, 7, 21)
- Under misspecification, the diagnostics do not establish how much to trust the correction. All four candidate families are rejected in one iPinYou setting. The appendix also shows that a better likelihood can come with a larger price-distribution error. (pp. 8, 23)
Questions for authors
- How many low-bid wins are available to the actual network? If these samples are reduced, do the parameter estimates and corrected distributions remain stable?
- When all candidate families are rejected, what reliable conclusions can the logs still support? How much do the key bidding results vary across families?
3 comments
Follow-up on Our Response
Dear Reviewer 2jPa,
Thank you again for your review. The discussion period ends soon. Could you let us know whether our response addresses your concerns? It includes the row-reduction experiment you asked about in Q1 and the bidding results across copula families for Q2. We would be glad to answer any remaining questions.
The response addresses my concern, I decide to keep my positive score.
Response to the Review
We are grateful to the reviewer for valuable feedback and for highlighting the strengths of our work.
Q1. Low-bid wins and stability after reduction
(1) Low-bid win counts
There are 2,173 wins at the smallest bid of 7, and 8,725 wins in the bottom bid decile. AuctionNet has no wins at its smallest bid or in the bottom bid decile.
(2) Stability after reduction
On iPinYou at λ=0.5, reducing the smallest-bid rows by 98% left θ^ nearly unchanged. The corrected model still had lower CDF error than the censored network. To address the reviewer's question, we reduced the iPinYou rows at the smallest bid and retrained with three seeds.
On this stream, estimating θ did not require retaining most of the rows at the smallest bid.
Q2, W2. Bidding across copula families and misspecification diagnostics
(1) Bidding results across families
Gaussian and Frank give similar results on iPinYou. On AuctionNet, both improve over the censored network, with a larger gain for Gaussian.
The censored-network and Gaussian values are from Table 3.
(2) Conclusions after rejection
The logs still support the assumption-free sharp identified set (Proposition 1), which affiliation narrows to sharp bounds (Theorem 1(i)). In C2 of the general comment, we explain what remains supported when all families are rejected and why a likelihood gain does not establish price-margin accuracy.
W1. Strong dependence and CDF error above p90
(1) CDF error above p90
On the iPinYou rank mixture, correction reduced CDF error relative to the censored network between p90 and bmax.
We report errors up to bmax because the log records no prices above it, and by Proposition 1 the CDF there is not identified without a tail assumption.
(2) Error under strong dependence
At λ=0.75, the correction still reduced CDF error up to p90 from 0.117 to 0.075, about 36% (Appendix B). Even given the true dependence, the copula-graphic recursion has a CDF error of 0.062 there (Figure 2, left). In C1 of the general comment, we address the reviewer's concern about the guarantee.
We are happy to answer further questions during the discussion period.