2019
DOI: 10.1287/mnsc.2018.3070
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Credit-Collections Optimization

Abstract: Based on a dynamic model of the stochastic repayment behavior exhibited by delinquent credit-card accounts in the form of a self-exciting point process, a bank can control the arrival intensity of repayments using costly account-treatment actions. A semianalytic solution to the corresponding stochastic optimal control problem is obtained using a recursive approach. For a linear cost of treatment effort, the optimal policy in the two-dimensional (intensity, balance) space is described by the frontier of a conve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 53 publications
0
16
0
Order By: Relevance
“…Operations management researchers have studied the optimization of loan recovery strategies by using statistical and machine learning algorithms. For example, Chehrazi et al., (2019) developed a dynamic stochastic model to optimize the intensity of debt collections for maximizing the net value of an account. Dynamic programming models and reinforcement learning models have also been applied in optimizing the time of different debt collection actions (calls, reminder messages, and warrant) (Abe et al., 2010, De Almeida Filho et al., 2010).…”
Section: Literature Background and Hypotheses Developmentmentioning
confidence: 99%
“…Operations management researchers have studied the optimization of loan recovery strategies by using statistical and machine learning algorithms. For example, Chehrazi et al., (2019) developed a dynamic stochastic model to optimize the intensity of debt collections for maximizing the net value of an account. Dynamic programming models and reinforcement learning models have also been applied in optimizing the time of different debt collection actions (calls, reminder messages, and warrant) (Abe et al., 2010, De Almeida Filho et al., 2010).…”
Section: Literature Background and Hypotheses Developmentmentioning
confidence: 99%
“…We take 100 bootstrap replicates with the same size of the data. For each replicate, we solve the nonlinear optimization model (11) and obtain a set of coefficients. Then we calculate ∆ and T , as the inter-arrival time change and the expected sojourn time change as described in Section 4.2, for each replicate based on its fitted coefficients.…”
Section: B Statistical Significance Results Of Fitted Parametersmentioning
confidence: 99%
“…A CTMC lends itself to interpretation by associating transitions in the model with assumed phases of a client using syringes after leaving a service location. In addition to the references mentioned in Section 1, which use CTMCs with hidden states [11,27,30], we note that such an approach has also been used to model the length of stay of hospital patients [15,16,17], including work in which serial (Coxian) CTMCs are employed. We use a similar philosophy by inferring transition rates from unobservable states and, moreover, connecting them to features of a client.…”
Section: Reoccurring Visitsmentioning
confidence: 99%
“…The performance of financial institutions relies on the efficient collection of outstanding unsecured customer debt (Chehrazi et al, 2019). Among the various debt collection methods utilized in debt collection services (Du et al, 2020;Karlan et al, 2012), debt collection calls are the most widely used (Elliott, 2008;Griffith, 2009).…”
Section: Introductionmentioning
confidence: 99%