- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper studies regret minimization in the sequential market-making problem. Consider a market maker who offers an ask price () and a bid price () for a financial asset to a trader, who holds a private valuation for that asset. The trader’s valuation, , is stochastic and unknown to the market maker. If a transaction occurs (a purchase or a sale), the market maker then offsets the position by trading with the broader market at a price . The market maker’s utility is the price difference between the transaction with the trader and the offsetting transaction with the market. Cumulative regret is defined as the gap between the utility obtained from the sequence of quotes (,) and the utility that would have been achieved by the optimal decision .
The paper studies this game within a full-feedback framework, where the market maker observes (,) after each round. Based on a discretization of the set of price pairs (A,B), the authors propose an algorithm with a regret bounded by . The algorithm estimates the probabilities of prices and that maximize utility, learning from past observations; it consists of two parallel instances of the Hedge algorithm. Furthermore, the paper establishes that if the values are no longer i.i.d. but instead adversarial, the regret cannot be sublinear, meaning that learning is not possible.
In the second part, the paper considers a different setting, referred to as a "limit order book" feedback model. After each round t, the market maker observes . The trader’s valuation, , is an i.i.d. stochastic variable; it is revealed at the end of the round only if no transaction has taken place between the market maker and the trader. The authors note that, for valuations falling between and , the utility remains estimable even without knowing the exact value of . They propose an algorithm similar to the previous one and establish a regret bound of the order of .
Critical strengths
-
This paper substantially enriches the existing literature on the online market maker problem. It provides new results across several settings. Specifically, in the limit order book feedback setting, it improves upon the result obtained by Maran & Restelli (2026) which featured a regret of by presenting an algorithm with an optimal regret of (optimal up to a logarithmic factor). It also establishes an analogous result for the full feedback setting which wasn't previously studied and demonstrates that, in the adversarial case, learning is not possible. Cesa-Bianchi et al. (2024) highlighted a similar result, but within the context of bandit feedback.
-
The paper is well written and explained. It reads smoothly overall, and the intuitions behind the solutions are clear. The topic is interesting. It's situated at the intersection of learning and game theory thus covering topics of broader interest.
Critical weaknesses
- The novelty of the technical contributions is not sufficiently clear. Both algorithms is based on Hedge and the analysis is also classic for the bandit problems. It seemed to be an application of result already known on bandit for a new setting rather than a resolution of a new problem. The paper does not adequately explain which parts of the analysis are new or how they differ from existing approaches. This makes it difficult to assess the extent of the technical advance beyond the narrow scope of this particular problem. A conclusion with a discussion about further applications would have been very useful.
Questions for authors
-
Could you point out which technical parts represent substantial new contributions or ideas in the study of regret?
-
I am struggling to determine whether this paper introduces a new theoretical bandit framework or if it is an application of the "partial monitoring bandit" setting. What are the crucial differences between these two paradigms?
We thank the Reviewer for the positive evaluation of our work.
We thank the Reviewer for the opportunity to clarify this aspect. The purpose of this work is to close the regret-rate gap in the LOB feedback model introduced by [1], but we believe there are many other technical novelties in the proofs that need to be stressed.
We use a variant of EXP3-IX, but obtaining our guarantees requires the interval feedback reconstruction (Lemma 4.1), its logarithmic observation cost bound (Lemma 4.2), and the continuous optimum approximation (Lemma 3.2). This suggests that one could potentially apply the same reasoning beyond market making in problems where additional observations are implicitely given, although our established results concern the model studied here.
More specifically, Lemma 4.2 bounds the aggregate importance-weighting cost logarithmically in the grid size, improving over the polynomial dependence associated with treating grid points as ordinary bandit arms. This is the main novelty of our approach and allows us to improve on previous results. In Lemma 3.2 we transfer the discrete action guarantee to the continuous space, despite potentially discontinuous utilities. Lemma 3.2 establishes an O(1/K) approximation of the optimal cumulative expected utility under stochastic valuations and adversarial prices, without assuming a Lipschitz valuation CDF or concavity of the utility.
We also believe that a more straightforward reduction for the full-feedback setting can itself be viewed as a contribution, particularly at a time when overcomplication is becoming increasingly common.
Our problem can be formulated within the general partial monitoring framework, as LOB feedback provides additional, action-dependent information beyond the learner’s realized payoff. Our contribution concerns the regret guarantees and limits of learnability in this particular market making model.
We believe it is necessary to distinguish between this general formulation and the applicability of existing finite actions results. Our bid–ask action space is continuous, while the utility can be discontinuous. Discretization therefore requires both a controlled approximation of the continuous benchmark and a learning guarantee with sufficiently mild dependence on the grid size. The standard partial monitorning bandit alone does not establish these properties [2]. We use the ordered structure of prices and the information revealed throughout the interval between the sampled quotes in the results. In particular, the analysis of Lemma 4.2 is closely related to methods for graph-structured feedback [3], but requires a specific observation cost bound for the interval induced by two independently sampled endpoints, which is novel.
We will surely include this discussion in the final version of the paper.
[1] Maran & Restelli, 2026. Online market making and the value of observing the order book
[2] Bartók, G., Foster, D. P., Pál, D., Rakhlin, A., & Szepesvári, C. (2014). Partial Monitoring—Classification, Regret Bounds, and Algorithms. Mathematics of Operations Research, 39(4), 967–997. http://www.jstor.org/stable/24540997
[3] Alon, N., Cesa-Bianchi, N., Dekel, O., & Koren, T. (2015, June). Online learning with feedback graphs: Beyond bandits. In Conference on Learning Theory (pp. 23-35). PMLR.