IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v262y2018i1d10.1007_s10479-017-2732-8.html
   My bibliography  Save this article

CVaR distance between univariate probability distributions and approximation problems

Author

Listed:
  • Konstantin Pavlikov

    (University of Southern Denmark)

  • Stan Uryasev

    (University of Florida)

Abstract

The paper defines new distances between univariate probability distributions, based on the concept of the CVaR norm. We consider the problem of approximation of a discrete distribution by some other discrete distribution. The approximating distribution has a smaller number of atoms than the original one. Such problems, for instance, must be solved for generation of scenarios in stochastic programming. The quality of the approximation is evaluated with new distances suggested in this paper. We use CVaR constraints to assure that the approximating distribution has tail characteristics similar to the target distribution. The numerical algorithm is based on two main steps: (i) optimal placement of positions of atoms of the approximating distribution with fixed probabilities; (ii) optimization of probabilities with fixed positions of atoms. These two steps are iterated to find both optimal atom positions and probabilities. Numerical experiments show high efficiency of the proposed algorithms, solved with convex and linear programming.

Suggested Citation

  • Konstantin Pavlikov & Stan Uryasev, 2018. "CVaR distance between univariate probability distributions and approximation problems," Annals of Operations Research, Springer, vol. 262(1), pages 67-88, March.
    • Handle: RePEc:spr:annopr:v:262:y:2018:i:1:d:10.1007_s10479-017-2732-8
    DOI: 10.1007/s10479-017-2732-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2732-8
    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/s10479-017-2732-8?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.

    References listed on IDEAS

    as
    1. Mafusalov, Alexander & Uryasev, Stan, 2016. "CVaR (superquantile) norm: Stochastic case," European Journal of Operational Research, Elsevier, vol. 249(1), pages 200-208.
    2. Donald L. Keefer & Samuel E. Bodily, 1983. "Three-Point Approximations for Continuous Random Variables," Management Science, INFORMS, vol. 29(5), pages 595-609, May.
    3. Robert K. Hammond & J. Eric Bickel, 2013. "Reexamining Discrete Approximations to Continuous Distributions," Decision Analysis, INFORMS, vol. 10(1), pages 6-25, March.
    4. Allen C. Miller, III & Thomas R. Rice, 1983. "Discrete Approximations of Probability Distributions," Management Science, INFORMS, vol. 29(3), pages 352-362, March.
    5. James E. Smith, 1993. "Moment Methods for Decision Analysis," Management Science, INFORMS, vol. 39(3), pages 340-358, March.
    6. Philippe Artzner & Freddy Delbaen & Jean‐Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228, July.
    7. Donald L. Keefer, 1994. "Certainty Equivalents for Three-Point Discrete-Distribution Approximations," Management Science, INFORMS, vol. 40(6), pages 760-773, June.
    8. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pertaia Giorgi & Uryasev Stan, 2019. "Fitting heavy-tailed mixture models with CVaR constraints," Dependence Modeling, De Gruyter, vol. 7(1), pages 365-374, January.
    2. Juan Li & Bin Xin & Panos M. Pardalos & Jie Chen, 2021. "Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms," Annals of Operations Research, Springer, vol. 296(1), pages 639-666, January.
    3. Alessandro Barbiero & Asmerilda Hitaj, 2023. "Discrete approximations of continuous probability distributions obtained by minimizing Cramér-von Mises-type distances," Statistical Papers, Springer, vol. 64(5), pages 1669-1697, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Woodruff, Joshua & Dimitrov, Nedialko B., 2018. "Optimal discretization for decision analysis," Operations Research Perspectives, Elsevier, vol. 5(C), pages 288-305.
    2. Robert K. Hammond & J. Eric Bickel, 2013. "Reexamining Discrete Approximations to Continuous Distributions," Decision Analysis, INFORMS, vol. 10(1), pages 6-25, March.
    3. Kjetil Høyland & Stein W. Wallace, 2001. "Generating Scenario Trees for Multistage Decision Problems," Management Science, INFORMS, vol. 47(2), pages 295-307, February.
    4. Jing Ai & Patrick L. Brockett & Tianyang Wang, 2017. "Optimal Enterprise Risk Management and Decision Making With Shared and Dependent Risks," Journal of Risk & Insurance, The American Risk and Insurance Association, vol. 84(4), pages 1127-1169, December.
    5. Thomas W. Keelin & Bradford W. Powley, 2011. "Quantile-Parameterized Distributions," Decision Analysis, INFORMS, vol. 8(3), pages 206-219, September.
    6. Tanaka, Ken'ichiro & Toda, Alexis Akira, 2015. "Discretizing Distributions with Exact Moments: Error Estimate and Convergence Analysis," University of California at San Diego, Economics Working Paper Series qt7g23r5kh, Department of Economics, UC San Diego.
    7. Ravi Kashyap, 2016. "The Perfect Marriage and Much More: Combining Dimension Reduction, Distance Measures and Covariance," Papers 1603.09060, arXiv.org, revised Jul 2019.
    8. Kashyap, Ravi, 2019. "The perfect marriage and much more: Combining dimension reduction, distance measures and covariance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    9. Fadhil Y. Al-Aboosi & Mahmoud M. El-Halwagi, 2019. "A Stochastic Optimization Approach to the Design of Shale Gas/Oil Wastewater Treatment Systems with Multiple Energy Sources under Uncertainty," Sustainability, MDPI, vol. 11(18), pages 1-39, September.
    10. Soltani, Mohamad & Samorani, Michele & Kolfal, Bora, 2019. "Appointment scheduling with multiple providers and stochastic service times," European Journal of Operational Research, Elsevier, vol. 277(2), pages 667-683.
    11. Ignacio Rios & Andres Weintraub & Roger J.-B. Wets, 2016. "Building a stochastic programming model from scratch: a harvesting management example," Quantitative Finance, Taylor & Francis Journals, vol. 16(2), pages 189-199, February.
    12. Sahoo, Nihar R. & Mohapatra, Pratap K.J. & Mahanty, Biswajit, 2017. "Compliance choice analysis for India's thermal power sector in the market-based energy efficiency regime," Energy Policy, Elsevier, vol. 108(C), pages 624-633.
    13. Roman V. Ivanov, 2023. "The Semi-Hyperbolic Distribution and Its Applications," Stats, MDPI, vol. 6(4), pages 1-21, October.
    14. Yijing Li & Prakash P. Shenoy, 2012. "A Framework for Solving Hybrid Influence Diagrams Containing Deterministic Conditional Distributions," Decision Analysis, INFORMS, vol. 9(1), pages 55-75, March.
    15. De Reyck, Bert & Degraeve, Zeger & Vandenborre, Roger, 2008. "Project options valuation with net present value and decision tree analysis," European Journal of Operational Research, Elsevier, vol. 184(1), pages 341-355, January.
    16. John M. Charnes & Prakash P. Shenoy, 2004. "Multistage Monte Carlo Method for Solving Influence Diagrams Using Local Computation," Management Science, INFORMS, vol. 50(3), pages 405-418, March.
    17. Salo, Ahti & Andelmin, Juho & Oliveira, Fabricio, 2022. "Decision programming for mixed-integer multi-stage optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 299(2), pages 550-565.
    18. Ramponi, Federico Alessandro & Campi, Marco C., 2018. "Expected shortfall: Heuristics and certificates," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1003-1013.
    19. Cui, Xueting & Zhu, Shushang & Sun, Xiaoling & Li, Duan, 2013. "Nonlinear portfolio selection using approximate parametric Value-at-Risk," Journal of Banking & Finance, Elsevier, vol. 37(6), pages 2124-2139.
    20. Karl Friedrich Mina & Gerald H. L. Cheang & Carl Chiarella, 2015. "Approximate Hedging Of Options Under Jump-Diffusion Processes," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 18(04), pages 1-26.

    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:annopr:v:262:y:2018:i:1:d:10.1007_s10479-017-2732-8. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.