Abstract
In this paper we discuss some properties of counting distributions whose discrete density satisfies a recursion in the form with p n = 0 for n < 0 and present an algorithm for recursive evaluation of corresponding compound distributions.
Cite
CITATION STYLE
APA
Sundt, B. (1992). On some Extensions of Panjer’s Class of Counting Distributions. ASTIN Bulletin, 22(1), 61–80. https://doi.org/10.2143/ast.22.1.2005127
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free