IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2512.24491.html

Minimal Solutions to the Skorokhod Reflection Problem Driven by Jump Processes and an Application to Reinsurance

Author

Listed:
  • Graeme Baker
  • Ankita Chatterjee

Abstract

We consider a reflected process in the positive orthant driven by an exogenous jump process. For a given input process, we show that there exists a unique minimal strong solution to the given particle system up until a certain maximal stopping time, which is stated explicitly in terms of the dual formulation of a linear programming problem associated with the state of the system. We apply this model to study the ruin time of interconnected insurance firms, where the stopping time can be interpreted as the failure time of a reinsurance agreement between the firms. Our work extends the analysis of the particle system in Baker, Hambly, and Jettkant (2025) to the case of jump driving processes, and the existence result of Reiman (1984) beyond the case of sub-stochastic reflection matrices.

Suggested Citation

  • Graeme Baker & Ankita Chatterjee, 2025. "Minimal Solutions to the Skorokhod Reflection Problem Driven by Jump Processes and an Application to Reinsurance," Papers 2512.24491, arXiv.org.
    • Handle: RePEc:arx:papers:2512.24491
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    2. Delarue, F. & Inglis, J. & Rubenthaler, S. & Tanré, E., 2015. "Particle systems with a singular mean-field self-excitation. Application to neuronal networks," Stochastic Processes and their Applications, Elsevier, vol. 125(6), pages 2451-2492.
    3. Monique Jeanblanc & Marc Yor & Marc Chesney, 2009. "Mathematical Methods for Financial Markets," Springer Finance, Springer, number 978-1-84628-737-4, March.
    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. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    2. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    3. Amarjit Budhiraja & Chihoon Lee, 2009. "Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 45-56, February.
    4. Budhiraja, Amarjit & Lee, Chihoon, 2007. "Long time asymptotics for constrained diffusions in polyhedral domains," Stochastic Processes and their Applications, Elsevier, vol. 117(8), pages 1014-1036, August.
    5. Zhen Xu & Jiheng Zhang & Rachel Q. Zhang, 2019. "Instantaneous Control of Brownian Motion with a Positive Lead Time," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 943-965, August.
    6. Bernardo D’Auria & José A. Salmeron, 2025. "Optimal portfolios with anticipating information on the stochastic interest rate," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 48(1), pages 301-328, June.
    7. David M. Markowitz & Martin I. Reiman & Lawrence M. Wein, 2000. "The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies," Operations Research, INFORMS, vol. 48(1), pages 136-154, February.
    8. Christa Cuchiero & Christoph Reisinger & Stefan Rigger, 2024. "Optimal bailout strategies resulting from the drift controlled supercooled Stefan problem," Annals of Operations Research, Springer, vol. 336(1), pages 1315-1349, May.
    9. I. Venkat Appal Raju & S. Ramasubramanian, 2016. "Risk Diversifying Treaty Between Two Companies with Only One in Insurance Business," Sankhya B: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 78(2), pages 183-214, November.
    10. Mor Armony & Constantinos Maglaras, 2004. "On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design," Operations Research, INFORMS, vol. 52(2), pages 271-292, April.
    11. Hainaut, Donatien, 2026. "American option pricing with model constrained Gaussian process regressions," Applied Mathematics and Computation, Elsevier, vol. 512(C).
    12. Saulius Minkevičius & Edvinas Greičius, 2019. "Heavy Traffic Limits for the Extreme Waiting Time in Multi-phase Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 109-124, March.
    13. Biswas, Anup & Budhiraja, Amarjit, 2011. "Exit time and invariant measure asymptotics for small noise constrained diffusions," Stochastic Processes and their Applications, Elsevier, vol. 121(5), pages 899-924.
    14. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    15. David M. Markowitz & Lawrence M. Wein, 2001. "Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem," Operations Research, INFORMS, vol. 49(2), pages 246-270, April.
    16. Saulius MinkeviÄ ius, 2020. "On the law of the iterated logarithm in hybrid multiphase queueing systems," Operations Research and Decisions, Wroclaw University of Science Technology, Faculty of Management, vol. 30(4), pages 57-64.
    17. Itai Gurvich, 2014. "Validity of Heavy-Traffic Steady-State Approximations in Multiclass Queueing Networks: The Case of Queue-Ratio Disciplines," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 121-162, February.
    18. Yamada, Keigo, 1999. "Two limit theorems for queueing systems around the convergence of stochastic integrals with respect to renewal processes," Stochastic Processes and their Applications, Elsevier, vol. 80(1), pages 103-128, March.
    19. Guillermo A. Alvarez & Sergey Nadtochiy, 2026. "Optimal contract design via relaxation: application to the problem of brokerage fee for a client with private signal," Finance and Stochastics, Springer, vol. 30(1), pages 119-158, January.
    20. Ward Whitt & Wei You, 2020. "Heavy-traffic limits for stationary network flows," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 53-68, June.

    More about this item

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