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

Improved Semi-Parametric Bounds for Tail Probability and Expected Loss: Theory and Applications

Author

Listed:
  • Zhaolin Li
  • Artem Prokhorov

Abstract

Many management decisions involve accumulated random realizations for which the expected value and variance are assumed to be known. We revisit the tail behavior of such quantities when individual realizations are independent, and we develop new sharper bounds on the tail probability and expected linear loss. The underlying distribution is semi-parametric in the sense that it remains unrestricted other than the assumed mean and variance. Our bounds complement well-established results in the literature, including those based on aggregation, which often fail to take full account of independence and use less elegant proofs. New insights include a proof that in the non-identical case, the distributions attaining the bounds have the equal range property, and that the impact of each random variable on the expected value of the sum can be isolated using an extension of the Korkine identity. We show that the new bounds %not only complement the extant results but also open up abundant practical applications, including improved pricing of product bundles, more precise option pricing, more efficient insurance design, and better inventory management. For example, we establish a new solution to the optimal bundling problem, yielding a 17\% uplift in per-bundle profits, and a new solution to the inventory problem, yielding a 5.6\% cost reduction for a model with 20 retailers.

Suggested Citation

  • Zhaolin Li & Artem Prokhorov, 2024. "Improved Semi-Parametric Bounds for Tail Probability and Expected Loss: Theory and Applications," Papers 2404.02400, arXiv.org, revised May 2024.
  • Handle: RePEc:arx:papers:2404.02400
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Hemant K. Bhargava, 2013. "Mixed Bundling of Two Independently Valued Goods," Management Science, INFORMS, vol. 59(9), pages 2170-2185, September.
    2. Gneiting, Tilmann & Raftery, Adrian E., 2007. "Strictly Proper Scoring Rules, Prediction, and Estimation," Journal of the American Statistical Association, American Statistical Association, vol. 102, pages 359-378, March.
    3. John C. Eckalbar, 2010. "Closed‐Form Solutions to Bundling Problems," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 19(2), pages 513-544, June.
    4. Cox, John C. & Ross, Stephen A. & Rubinstein, Mark, 1979. "Option pricing: A simplified approach," Journal of Financial Economics, Elsevier, vol. 7(3), pages 229-263, September.
    5. Didier Henrion & Felix Kirschner & Etienne De Klerk & Milan Korda & Jean-Bernard Lasserre & Victor Magron, 2023. "Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 335-349, March.
    6. Lo, Andrew W., 1987. "Semi-parametric upper bounds for option prices and expected payoffs," Journal of Financial Economics, Elsevier, vol. 19(2), pages 373-387, December.
    Full references (including those not matched with items on IDEAS)

    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. Ritwik Raj & Mark H. Karwan & Chase Murray & Lei Sun, 2022. "Itemized pricing in B2B bundles with diminishing reservation prices and loss averse customers," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 21(4), pages 375-392, August.
    2. Donald J. Brown & Rustam Ibragimov, 2005. "Sign Tests for Dependent Observations and Bounds for Path-Dependent Options," Cowles Foundation Discussion Papers 1518, Cowles Foundation for Research in Economics, Yale University.
    3. Lim, Terence & Lo, Andrew W. & Merton, Robert C. & Scholes, Myron S., 2006. "The Derivatives Sourcebook," Foundations and Trends(R) in Finance, now publishers, vol. 1(5–6), pages 365-572, April.
    4. Roy H. Kwon & Jonathan Y. Li, 2016. "A stochastic semidefinite programming approach for bounds on option pricing under regime switching," Annals of Operations Research, Springer, vol. 237(1), pages 41-75, February.
    5. Liu Weihua & Yu Hui, 2017. "Pure Components VS Full Mixed Bundling When Stackelberg Pricing," Journal of Systems Science and Information, De Gruyter, vol. 5(5), pages 435-445, October.
    6. Ryan, Peter J., 2003. "Progressive option bounds from the sequence of concurrently expiring options," European Journal of Operational Research, Elsevier, vol. 151(1), pages 193-223, November.
    7. Terrence August & Duy Dao & Kihoon Kim, 2019. "Market Segmentation and Software Security: Pricing Patching Rights," Management Science, INFORMS, vol. 65(10), pages 4575-4597, October.
    8. Donald Brown & Rustam Ibragimov, 2005. "Sign Tests for Dependent Observations and Bounds for Path-Dependent Options," Yale School of Management Working Papers amz2581, Yale School of Management, revised 01 Jul 2005.
    9. Roy Kwon & Jonathan Li, 2016. "A stochastic semidefinite programming approach for bounds on option pricing under regime switching," Annals of Operations Research, Springer, vol. 237(1), pages 41-75, February.
    10. Sreya Kolay & Rajeev K. Tyagi, 2022. "Optimal Bundling of Events," Marketing Science, INFORMS, vol. 41(2), pages 380-400, March.
    11. DeMarzo, Peter M. & Kremer, Ilan & Mansour, Yishay, 2016. "Robust option pricing: Hannan and Blackwell meet Black and Scholes," Journal of Economic Theory, Elsevier, vol. 163(C), pages 410-434.
    12. Jun-ya Gotoh & Hiroshi Konno, 2002. "Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm," Management Science, INFORMS, vol. 48(5), pages 665-678, May.
    13. Banciu, M. & Ødegaard, F., 2016. "Optimal product bundling with dependent valuations: The price of independence," European Journal of Operational Research, Elsevier, vol. 255(2), pages 481-495.
    14. Jun-ya Gotoh & Yoshitsugu Yamamoto & Weifeng Yao, 2011. "Bounding Contingent Claim Prices via Hedging Strategy with Coherent Risk Measures," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 613-632, December.
    15. Masoud Talebian & Zhaolin Li & Qiang Lu, 2020. "Pricing and inventory management for mixed bundled products with stochastic demand," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(6), pages 401-410, December.
    16. Donald Brown & Rustam Ibragimov & Johan Walden, 2015. "Bounds for path-dependent options," Annals of Finance, Springer, vol. 11(3), pages 433-451, November.
    17. Weihan Li & Jin E. Zhang & Xinfeng Ruan & Pakorn Aschakulporn, 2024. "An empirical study on the early exercise premium of American options: Evidence from OEX and XEO options," Journal of Futures Markets, John Wiley & Sons, Ltd., vol. 44(7), pages 1117-1153, July.
    18. Dybvig, Philip H. & Gong, Ning & Schwartz, Rachel, 2000. "Bias of Damage Awards and Free Options in Securities Litigation," Journal of Financial Intermediation, Elsevier, vol. 9(2), pages 149-168, April.
    19. Azar, Pablo D. & Micali, Silvio, 2018. "Computational principal agent problems," Theoretical Economics, Econometric Society, vol. 13(2), May.
    20. Boyarchenko, Svetlana & Levendorskii[caron], Sergei, 2007. "Optimal stopping made easy," Journal of Mathematical Economics, Elsevier, vol. 43(2), pages 201-217, February.

    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:2404.02400. 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: 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.