IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i8p1332-1348.html
   My bibliography  Save this article

Debtor level collection operations using Bayesian dynamic programming

Author

Listed:
  • Mee Chi So
  • Christophe Mues
  • Adiel T. de Almeida Filho
  • Lyn C Thomas

Abstract

After a borrower defaults on their repayment obligations, collectors of unsecured consumer credit debt have a number of actions (e.g., telephone calls, formal letters,) they can take to secure some repayment of the debt. If these actions fail, collectors could seek legal proceedings. The operations management challenge in this setting is to decide which of these actions to take, how long to take them, and in what sequence to take them. Ideally, this collection policy should depend on how the defaulter has been performing during the collection process so far. In particular, it should take into account how many payments the defaulter has made under the current action, compared with how long that action has been tried. Other potential considerations aside, the objective of a collections policy typically is to maximize the recovery rate, i.e., the percentage of the defaulted debt that is recovered in the collections process. In this paper, we use a Bayesian Markov Decision Process (MDP) model to find an optimal policy of what action to undertake in the next period given the current information on the individual debtor’s repayment performance thus far. The proposed model will be empirically validated with data provided by a European bank’s in-house collections department. The model will be able to use by banks to decide their debt collection strategy.

Suggested Citation

  • Mee Chi So & Christophe Mues & Adiel T. de Almeida Filho & Lyn C Thomas, 2019. "Debtor level collection operations using Bayesian dynamic programming," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(8), pages 1332-1348, August.
  • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:8:p:1332-1348
    DOI: 10.1080/01605682.2018.1506557
    as

    Download full text from publisher

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

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jiří Witzany & Anastasiia Kozina, 2022. "Recovery process optimization using survival regression," Operational Research, Springer, vol. 22(5), pages 5269-5296, November.
    2. Bellotti, Anthony & Brigo, Damiano & Gambetti, Paolo & Vrins, Frédéric, 2021. "Forecasting recovery rates on non-performing loans with machine learning," International Journal of Forecasting, Elsevier, vol. 37(1), pages 428-444.
    3. Arno Botha & Conrad Beyers & Pieter de Villiers, 2020. "The loss optimisation of loan recovery decision times using forecast cash flows," Papers 2010.05601, arXiv.org.
    4. Julio Cezar Soares Silva & Diogo Ferreira de Lima Silva & Luciano Ferreira & Adiel Teixeira de Almeida-Filho, 2022. "A dominance-based rough set approach applied to evaluate the credit risk of sovereign bonds," 4OR, Springer, vol. 20(1), pages 139-164, March.
    5. Arno Botha & Conrad Beyers & Pieter de Villiers, 2020. "Simulation-based optimisation of the timing of loan recovery across different portfolios," Papers 2009.11064, arXiv.org, revised Apr 2021.

    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:tjorxx:v:70:y:2019:i:8:p:1332-1348. 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/tjor .

    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.