IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v66y2025i6d10.1007_s10614-025-10888-2.html
   My bibliography  Save this article

Multivariate Risk Analysis in Cryptocurrency Market: An Optimal Transport Approach

Author

Listed:
  • João Pedro M. Franco

    (FEARP - University of São Paulo)

  • Márcio Laurini

    (FEARP - University of São Paulo)

Abstract

This study examines the cryptocurrency market by introducing novel multivariate risk measures rooted in optimal transport theory to estimate Vectors-at-Risk (VaR) and Conditional Vectors-at-Risk (CVaR). We compare these measures against traditional univariate and copula-based methods for estimating Value-at-Risk and Conditional Value-at-Risk, focusing on factors such as magnitude, computational efficiency, and backtesting performance. The findings reveal that, while the proposed method incurs significantly higher computational costs, it effectively captures the correlation structure among assets’ risks, resulting in more conservative tail risk estimates compared to conventional techniques. As financial markets continue to evolve, the implications of adopting advanced tail risk measures such as those based on Optimal Coupling will be crucial for maintaining financial stability and mitigating systemic risk. Therefore, we believe that this study can be very useful in the context of regulatory frameworks, economic stability, risk management, and portfolio selection.

Suggested Citation

  • João Pedro M. Franco & Márcio Laurini, 2025. "Multivariate Risk Analysis in Cryptocurrency Market: An Optimal Transport Approach," Computational Economics, Springer;Society for Computational Economics, vol. 66(6), pages 5257-5298, December.
    • Handle: RePEc:kap:compec:v:66:y:2025:i:6:d:10.1007_s10614-025-10888-2
    DOI: 10.1007/s10614-025-10888-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-025-10888-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10614-025-10888-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:kap:compec:v:66:y:2025:i:6:d:10.1007_s10614-025-10888-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.