IDEAS home Printed from https://ideas.repec.org/a/taf/sactxx/v1997y1997i2p138-148.html
   My bibliography  Save this article

Upper bounds for the tail of the compound negative binomial distribution

Author

Listed:
  • Gordon E. Willmot
  • Xiaodong Lin

Abstract

A general upper bound for the tail of the compound negative binomial distribution is constructed. By establishing a connection with the individual risk mode the upper bound is seen to be a (possibly degenerate) mixture of tails of gamma distributions. The bound is sharp in that it is an equality in the compound Pascal-exponential case. Two important special cases of the bound are derived. The issue of construction of an optimal upper bound is considered.

Suggested Citation

  • Gordon E. Willmot & Xiaodong Lin, 1997. "Upper bounds for the tail of the compound negative binomial distribution," Scandinavian Actuarial Journal, Taylor & Francis Journals, vol. 1997(2), pages 138-148.
  • Handle: RePEc:taf:sactxx:v:1997:y:1997:i:2:p:138-148
    DOI: 10.1080/03461238.1997.10413983
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03461238.1997.10413983
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03461238.1997.10413983?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.

    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:taf:sactxx:v:1997:y:1997:i:2:p:138-148. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/sact .

    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.