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

Smart Contract Adoption under Discrete Overdispersed Demand: A Negative Binomial Optimization Perspective

Author

Listed:
  • Jinho Cha
  • Sahng-Min Han
  • Long Pham

Abstract

Effective supply chain management under high-variance demand requires models that jointly address demand uncertainty and digital contracting adoption. Existing research often simplifies demand variability or treats adoption as an exogenous decision, limiting relevance in e-commerce and humanitarian logistics. This study develops an optimization framework combining dynamic Negative Binomial (NB) demand modeling with endogenous smart contract adoption. The NB process incorporates autoregressive dynamics in success probability to capture overdispersion and temporal correlation. Simulation experiments using four real-world datasets, including Delhivery Logistics and the SCMS Global Health Delivery system, apply maximum likelihood estimation and grid search to optimize adoption intensity and order quantity. Across all datasets, the NB specification outperforms Poisson and Gaussian benchmarks, with overdispersion indices exceeding 1.5. Forecasting comparisons show that while ARIMA and Exponential Smoothing achieve similar point accuracy, the NB model provides superior stability under high variance. Scenario analysis reveals that when dispersion exceeds a critical threshold (r > 6), increasing smart contract adoption above 70% significantly enhances profitability and service levels. This framework offers actionable guidance for balancing inventory costs, service levels, and implementation expenses, highlighting the importance of aligning digital adoption strategies with empirically observed demand volatility.

Suggested Citation

  • Jinho Cha & Sahng-Min Han & Long Pham, 2025. "Smart Contract Adoption under Discrete Overdispersed Demand: A Negative Binomial Optimization Perspective," Papers 2510.05487, arXiv.org.
  • Handle: RePEc:arx:papers:2510.05487
    as

    Download full text from publisher

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

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