MétaCan
Menu
Back to cohort
Record W2324589850 · doi:10.1017/s0515036100015051

The Decompositions of the Discounted Penalty Functions and Dividends-Penalty Identity in a Markov-Modulated Risk Model

2008· article· en· W2324589850 on OpenAlexafffund
Shuanming Li, Yi Lu

Bibliographic record

VenueAstin Bulletin · 2008
Typearticle
Languageen
FieldDecision Sciences
TopicProbability and Risk Models
Canadian institutionsSimon Fraser University
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of Pittsburgh
KeywordsPenalty methodDividendMarkov chainMathematicsPoisson distributionTerminal (telecommunication)Markov processIdentity (music)JumpRuin theoryMathematical optimizationEconometricsRisk modelApplied mathematicsMathematical economicsEconomicsStatisticsComputer science

Abstract

fetched live from OpenAlex

In this paper, we study the expected discounted penalty functions and their decompositions in a Markov-modulated risk process in which the rate for the Poisson claim arrivals and the distribution of the claim amounts vary in time depending on the state of an underlying (external) Markov jump process. The main feature of the model is the flexibility modeling the arrival process in the sense that periods with very frequent arrivals and periods with very few arrivals may alternate. Explicit formulas for the expected discounted penalty function at ruin, given the initial surplus, and the initial and terminal environment states, are obtained when the initial surplus is zero or when all the claim amount distributions are from the rational family. We also investigate the distributions of the maximum surplus before ruin and the maximum severity of ruin. The dividends-penalty identity is derived when the model is modified by applying a barrier dividend strategy.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.010
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0020.001
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0040.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.053
GPT teacher head0.330
Teacher spread0.277 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations38
Published2008
Admission routes2
Has abstractyes

Explore more

Same venueAstin BulletinSame topicProbability and Risk ModelsFrench-language works237,207