IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2508.00554.html
   My bibliography  Save this paper

ContestTrade: A Multi-Agent Trading System Based on Internal Contest Mechanism

Author

Listed:
  • Li Zhao
  • Rui Sun
  • Zuoyou Jiang
  • Bo Yang
  • Yuxiao Bai
  • Mengting Chen
  • Xinyang Wang
  • Jing Li
  • Zuo Bai

Abstract

In financial trading, large language model (LLM)-based agents demonstrate significant potential. However, the high sensitivity to market noise undermines the performance of LLM-based trading systems. To address this limitation, we propose a novel multi-agent system featuring an internal competitive mechanism inspired by modern corporate management structures. The system consists of two specialized teams: (1) Data Team - responsible for processing and condensing massive market data into diversified text factors, ensuring they fit the model's constrained context. (2) Research Team - tasked with making parallelized multipath trading decisions based on deep research methods. The core innovation lies in implementing a real-time evaluation and ranking mechanism within each team, driven by authentic market feedback. Each agent's performance undergoes continuous scoring and ranking, with only outputs from top-performing agents being adopted. The design enables the system to adaptively adjust to dynamic environment, enhances robustness against market noise and ultimately delivers superior trading performance. Experimental results demonstrate that our proposed system significantly outperforms prevailing multi-agent systems and traditional quantitative investment methods across diverse evaluation metrics. ContestTrade is open-sourced on GitHub at https://github.com/FinStep-AI/ContestTrade.

Suggested Citation

  • Li Zhao & Rui Sun & Zuoyou Jiang & Bo Yang & Yuxiao Bai & Mengting Chen & Xinyang Wang & Jing Li & Zuo Bai, 2025. "ContestTrade: A Multi-Agent Trading System Based on Internal Contest Mechanism," Papers 2508.00554, arXiv.org, revised Aug 2025.
  • Handle: RePEc:arx:papers:2508.00554
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2508.00554
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2508.00554. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.