Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > q-fin > arXiv:2407.01566v2

Help | Advanced Search

Quantitative Finance > Computational Finance

arXiv:2407.01566v2 (q-fin)
[Submitted on 22 May 2024 (v1) , last revised 14 Aug 2025 (this version, v2)]

Title: A Parametric Contextual Online Learning Theory of Brokerage

Title: 一种经纪的参数化上下文在线学习理论

Authors:François Bachoc, Tommaso Cesari, Roberto Colomboni
Abstract: We study the role of contextual information in the online learning problem of brokerage between traders. In this sequential problem, at each time step, two traders arrive with secret valuations about an asset they wish to trade. The learner (a broker) suggests a trading (or brokerage) price based on contextual data about the asset and the market conditions. Then, the traders reveal their willingness to buy or sell based on whether their valuations are higher or lower than the brokerage price. A trade occurs if one of the two traders decides to buy and the other to sell, i.e., if the broker's proposed price falls between the smallest and the largest of their two valuations. We design algorithms for this problem and prove optimal theoretical regret guarantees under various standard assumptions.
Abstract: 我们研究上下文信息在交易者之间经纪在线学习问题中的作用。 在这个序列问题中,每个时间步,两个交易者带着他们希望交易的资产的秘密估值到来。 学习者(经纪人)根据关于资产和市场状况的上下文数据建议一个交易(或经纪)价格。 然后,交易者根据他们的估值是否高于或低于经纪价格来揭示他们购买或出售的意愿。 如果其中一个交易者决定购买而另一个决定出售,即如果经纪人提出的价格介于他们的两个估值的最小值和最大值之间,则会发生交易。 我们为此问题设计了算法,并在各种标准假设下证明了最优的理论遗憾保证。
Subjects: Computational Finance (q-fin.CP) ; Computer Science and Game Theory (cs.GT); Machine Learning (cs.LG); Machine Learning (stat.ML)
Cite as: arXiv:2407.01566 [q-fin.CP]
  (or arXiv:2407.01566v2 [q-fin.CP] for this version)
  https://doi.org/10.48550/arXiv.2407.01566
arXiv-issued DOI via DataCite

Submission history

From: Tommaso Cesari [view email]
[v1] Wed, 22 May 2024 18:38:05 UTC (24 KB)
[v2] Thu, 14 Aug 2025 17:53:29 UTC (28 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
q-fin.CP
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.GT
cs.LG
q-fin
stat
stat.ML

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号