1. Lack of comparisons with alternative demand-learning methods.
My main concern is the absence of theoretical and/or experimental comparisons with alternative approaches for learning aggregate demand.
The experiments compare different variants and implementations of CRM, but do not establish whether the proposed method offers advantages over other demand-prediction methods.
For example, natural baselines could include:
- Standard neural network regressors for predicting aggregate expenditure shares, with appropriate output constraints.
- Fixed-size mixtures of CES demand functions, whose parameters and mixture weights are jointly estimated rather than constructed incrementally.
These comparisons would help clarify the benefits of the proposed constructive approach in terms of prediction accuracy, sample efficiency, and computational cost.
This issue is particularly relevant because the basic experiments generate markets from CES consumers and then learn their aggregate demand using mixtures of CES androids. Thus, the true aggregate demand belongs to the model class under the constant-wealth setting. While the experiments demonstrate that CRM can learn such markets, they provide limited evidence of its advantages over competing approaches.
The generalized CES experiments partially address model misspecification, but comparisons with alternative estimators remain important.
2. The practical scope of the proposed approach needs to be clarified.
The paper motivates CRM as a tool for decision-making in real markets. However, it remains unclear which practical decisions can be supported by the learned aggregate demand function.
I do not think that CRM necessarily needs to support the full range of structural estimation considered in econometric demand estimation. Recovering individual preferences or predicting the effects of interventions on individual wealth distributions may be unnecessary for the paper's intended applications.
Nevertheless, the authors should more clearly identify the market environments and decisions for which learning the aggregate price-response function is sufficient.
For example, large markets with approximately price-taking consumers may provide a compelling application. When individual participants have negligible influence on market outcomes, predicting aggregate demand responses to exogenously specified prices may be sufficient for market-clearing price determination or resource allocation, provided that preferences, budgets, and other relevant market conditions remain stable.
Such a setting could provide a stronger practical motivation for CRM without requiring identification of individual preferences.
It would also be useful to clarify the distinction between predicting aggregate demand under alternative prices and conducting more general structural counterfactual analyses. A comparison with structural demand models, such as BLP-type approaches, might be informative in a suitably designed common setting focused on price interventions, although their standard market environments differ substantially from the divisible-goods markets studied here.
3. The incremental value of constructing a surrogate market is not fully demonstrated.
The application to proportionally fair allocation is interesting, and the paper provides theoretical welfare guarantees under appropriate assumptions. However, the surrogate market primarily serves to compute an approximate market-clearing price. The final allocation is then constructed using actual demand reports from individual participants. This raises a natural question: could a conventional aggregate-demand predictor, combined with a suitable equilibrium-finding procedure, achieve comparable welfare performance?
The paper would be considerably strengthened by comparing alternative demand-learning methods not only in prediction accuracy but also in their downstream performance, including equilibrium accuracy, Nash-welfare loss, and computational efficiency.
Response to Reviewer sDRD
We appreciate your feedback on the presentation and on how the convergence analysis relates to the algorithm used in our experiments. We will carefully address your concerns below.
W1: Readability.
We sincerely thank you for carefully evaluating our paper and apologize for the parts that were difficult to follow. Your comments, together with those of Reviewer BTTP, have helped us identify concrete ways to improve the introduction and clarify the technical presentation. We will address these issues in the revised manuscript.
W2: Connection between Theorem 4.2 and the experiments.
We sincerely thank you for your careful reading and the opportunity to clarify how the theory and experiments complement each other.
(i) Choice of Frank-Wolfe methods. We present an analysis for the smoothed, full-data Frank–Wolfe method in Theorem 4.2 and Appendix E.3. In our experiments, we use fully corrective FCFW with mini batches (i.e., stochastic FCFW, SFCFW) instead of full samples for efficiency purposes. Note that the SFCFW methods are well studied in the literature, so we did not present the convergence analysis see, for example, Fully-Corrective Frank-Wolfe in [1] and Stochastic Frank–Wolfe in [2].
(ii) Choice of solving SEP. For our empirical scheme, Theorem 4.2 tracks the error from approximate SEP solutions through ET, which is accumulated from the errors by SEP. For CES androids, if we use a branch-and-bound method (by Gurobi), it returns a feasible value v and a global upper bound U, so U−v bounds the SEP error; while the local method (by L-BFGS) could supply a feasible solution without this global certificate. In the solver, we provide both methods. In the paper, Tables 6–7 assess the local SEP solver against Gurobi and shows that L-BFGS matches Gurobi's best feasible value to the reported precision on 19 of 20 instances.
Table 8 explains this computational choice. At batch size 10, Gurobi already requires over 15,000 seconds of SEP time per run, versus about 11 seconds for L-BFGS. Hence, in the CRM L-BFGS is used for most of the time unless the progress is slow. We appreciate your suggestion and will further clarify this distinction in the manuscript.
References
[1] Jaggi, M.: Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization, Proceedings of the 30th International Conference on Machine Learning, PMLR 28(1), 427–435, https://proceedings.mlr.press/v28/jaggi13.html, (2013).
[2] Hazan, E., and Luo, H. Variance-Reduced and Projection-Free Stochastic Optimization. ICML, https://proceedings.mlr.press/v48/hazana16.html, (2016).