{"paper_id":"2405.13102","title":"Trading Volume Maximization with Online Learning","authors":["Tommaso Cesari","Roberto Colomboni"],"paper_date":"2024-05-21","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2405.13102v1","page_url":"https://thequant.space/flowcharts/trading-volume-maximization-with-online-learning/","scores":{"empirical_rigor":2,"math_complexity":7.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes online learning algorithms for a broker to maximize trading volume (the total number of trades) under different feedback models.","quote":"In contrast, we investigate how the broker should behave to maximize the trading volume, i.e., the total number of trades. 1.2 Overview of Our Contributions In the full-feedback case, if the distribution ν of the traders’ valuations has a continuous cdf, we design an algorithm (Algorithm 1) suﬀering O(ln T ) regret in the time horizon T (Theorem 1), and we provide a matching lower bound (Theorem 2).","summary":"We explore brokerage between traders in an online learning framework. At any round t, two traders meet to exchange an asset, provided the exchange is mutually beneficial. The broker proposes a trading price, and each trader tries to sell their asset or buy the asset from the other party, depending…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Traders' valuations are drawn i.i.d. from an unknown distribution.","type":"statistical","stated":"explicit","quote":"We model the traders' valuations as an i.i.d. process with an unknown distribution.","support":"full"},{"assumption":"In the full‑feedback case the valuation distribution has a continuous cumulative distribution function.","type":"statistical","stated":"explicit","quote":"If the traders' valuations are revealed after each interaction (full-feedback), and the traders' valuations cumulative distribution function (cdf) is continuous, we provide an algorithm achieving logarithmic regret and show its optimality up to constant factors.","support":"full"},{"assumption":"In the 2‑bit feedback case the valuation distribution’s cdf is Lipschitz.","type":"statistical","stated":"explicit","quote":"If only their willingness to sell or buy at the proposed price is revealed after each interaction ($2$-bit feedback), we provide an algorithm achieving poly-logarithmic regret when the traders' valuations cdf is Lipschitz and show that this rate is near-optimal.","support":"full"},{"assumption":"Traders have no fixed buyer or seller roles and can sell or buy depending on the posted price.","type":"market","stated":"explicit","quote":"1.5 Limitations This paper investigates a setting where traders lack rigid buyer/seller roles.","support":"full"},{"assumption":"The analysis focuses on an i.i.d. setting; results may not extend to non‑i.i.d. environments.","type":"model","stated":"explicit","quote":"Another conceivable limitation of this work is our focus on an i.i.d. setting.","support":"full"},{"assumption":"Fast regret rates rely on regularity assumptions (continuity or Lipschitzness) of the valuation cdf.","type":"statistical","stated":"explicit","quote":"Lastly, we obtain fast regret rates only under regularity assumptions on the cdf of the traders’ valuations.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"With full‑feedback and a continuous cdf, the proposed algorithm achieves O(log T) regret, which is optimal up to constant factors.","kind":"theoretical","quote":"If the traders' valuations are revealed after each interaction (full-feedback), and the traders' valuations cumulative distribution function (cdf) is continuous, we provide an algorithm achieving logarithmic regret and show its optimality up to constant factors. 1.2 Overview of Our Contributions In the full-feedback case, if the distribution ν of the traders’ valuations has a continuous cdf, we design an algorithm","support":"full"},{"finding":"If the continuous‑cdf assumption is dropped, regret degrades to Θ(√T) in the full‑feedback case.","kind":"theoretical","quote":"If we drop the continuous cdf assumption, the regret rate degrades to $Θ(\\sqrt{T})$ in the full-feedback case, where $T$ is the time horizon.","support":"full"},{"finding":"In the 2‑bit feedback case with a Lipschitz cdf, the binary‑search‑based algorithm attains O(log(MT)·log T) regret, which is near‑optimal up to a log T factor.","kind":"theoretical","quote":"In contrast, we exploit the extra information provided by the 2-bit feedback and the intuition provided by Lemma 1 to devise a binary search algorithm achieving the exponentially better rate of O(ln(MT )lnT ), 3 with the additional feature of being oblivious to M. Our corresponding lower bound shows that this rate is optimal (up to a ln T factor), Interestingly, using our diﬀerent reward function, we achieve an","support":"full"},{"finding":"Removing the Lipschitz cdf assumption makes learning impossible in the 2‑bit feedback setting.","kind":"negative","quote":"If we drop the Lipschitz cdf assumption, learning becomes impossible in the $2$-bit feedback case. If the Lipschitz cdf assumption is removed, the learning rate for both our problem and the one in [6] degrades to Θ( √ T) in the full-feedback case, and the problem becomes unlearnable in the 2-bit feedback case.","support":"full"},{"finding":"Compared to prior work on gain‑from‑trade, the new volume‑maximization objective yields exponentially faster regret bounds under the same regularity conditions.","kind":"theoretical","quote":"Surprisingly, in the same full-feedback case, but using our diﬀerent reward function, we achieve a Θ(lnT ) regret rate even when the cdf is only continuous: in our case, the additional Lipschitz regularity does not oﬀer any speedup once the continuity assumption is fulﬁlled. Interestingly, using our diﬀerent reward function, we achieve an exponentially faster upper bound of O(ln(MT )lnT ), which is tight up to a ln","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":9,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:57:29Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}