IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v21y2024i1d10.1007_s10287-023-00488-6.html
   My bibliography  Save this article

A multiobjective optimization approach for threshold determination in extreme value analysis for financial time series

Author

Listed:
  • Carlin C. F. Chu

    (The Hang Seng University of Hong Kong)

  • Simon S. W. Li

    (The Hang Seng University of Hong Kong)

Abstract

The literature on the extreme value theory threshold optimization problem for multiple time series analysis does not consider determining a single optimal tail probability for all marginal distributions. With multiple tail probabilities, their discrepancy results in a differing number of exceedances, which may favour a particular marginal series. In this study, we propose a single optimal tail probability by integrating trade-offs among multiple time series within an MOO framework. Mathematically, our approach links the peaks-over-threshold technique and goal programming technique by developing a set of regression functions, which represent continuous paths of possible tail areas for multiple time series, and we formulate them at the desired levels within a multiobjective optimization framework. The optimal solution is found as the minimum Chebyshev variant weighted value. Our approach advances the development of the peaks-over-threshold method by considering the characteristics of a group of time series collectively instead of independently. The proposed optimal tail probability can be considered an optimal reference point for practical risk investment portfolio analysis that employs an identical tail size across multiple time series data. The daily log returns of four U.S. stock market indices, namely, S&P 500, NASDAQ Composite, NYSE Composite, and Russell 2000, from 1 July 1992 to 30 June 2022 are studied empirically.

Suggested Citation

  • Carlin C. F. Chu & Simon S. W. Li, 2024. "A multiobjective optimization approach for threshold determination in extreme value analysis for financial time series," Computational Management Science, Springer, vol. 21(1), pages 1-14, June.
  • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00488-6
    DOI: 10.1007/s10287-023-00488-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00488-6
    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/s10287-023-00488-6?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 search for a different version of it.

    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:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00488-6. 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.