The present invention is generally related to the field of risk assessment and strategic decision making for large account portfolios. More specifically, the invention is directed towards a system, method, and apparatus utilizing a specialized computing device managing a contact center to analyze and reduce future financial risk associated with a portfolio of monitored accounts via a determination by the specialized computing device of whether or not to contact a customer of multiple customers regarding an unperformed account action, and, if so, the specialized computing device makes a determination of which communication channel to utilize to contact the customer of one or more communication channels available.
The personal lending industry, including the lending of student loans, auto loans, commercial loans, and mortgages, as well as other types of personal loans is valued at trillions of dollars in the United States in the twenty-first century. The total value of mortgages outstanding alone in the United States is approximately $10 trillion dollars. The total value of all student loans outstanding in the United States in 2013 is currently between $902 billion and $1 trillion. The sheer volume of this debt indicates that any time a large number of accounts may be in default. One statistic from Sep. 30, 2013 indicates 10% of borrowers default in two years of beginning repayment on student loans, and 14.7% default within three years of beginning repayment, both statistics an increase over analyzed statistics from previous years. “Default Rates Continue to Rise for Federal Student Loans,” U.S. DEPARTMENT OF EDUCATION, available at http://www.ed.gov/news/press-releases/default-rates-continue-rise-federal-student-loans (last visited Sep. 4, 2014). It could thus be roughly estimated that in the example of a lender/guarantor/servicer/other organization managing a portfolio of student loans (for example), more than 14% of customers might be expected to be in default at any time.
Lenders/guarantors/servicers or any other organization involved in reducing financial risk within any type of account portfolio (whether mortgages, auto loans, commercial loans, personal lines of credit, credit cards, or any other) always experience some level of financial risk, and desire to reduce it. Accordingly, a need exists for a system, method, and apparatus for managing risk associated with a portfolio of monitored accounts.
The present invention is directed to a system, method, and apparatus utilizing a specialized computing device managing a contact center to analyze and reduce future financial risk associated with a portfolio of monitored accounts via a determination by the specialized computing device of whether or not to contact a customer of multiple customers regarding an unperformed account action. The portfolio of monitored accounts may comprise loans, insurance claims, pending bills/liabilities, and medical/health actions. If the specialized computing device makes a determination of which communication channel to utilize to contact the customer of one or more communication channels available, the specialized computing device may make a further determination of which communication channel to utilize to make the contact. The one or more communication channels may comprise telephone calls, e-mails, text messages, web-chats, and social media messages.
In an embodiment of the invention, the invention comprises a system, method, and apparatus utilizing a specialized computing device managing a contact center to analyze and reduce future financial risk on a portfolio of monitored accounts via a determination of whether or not and, if so, when to utilize a communications channel of one or more communication channels available to contact a customer regarding a monitored account in the portfolio of monitored accounts, seeking to maximize advantage from contacting the customer to perform account-related pending actions while minimizing costs associated with contacting the customer.
Beginning execution, the specialized computing device receives a plurality of variables indicating action history and transactions associated with the monitored account held by the customer. The specialized computing device then stores into associated memory the plurality of variables indicating action history and transactions associated with the monitored account. The specialized computing device receives a variable defining a maximum look-ahead timeframe and a variable defining a periodic basis and stores the variable defining the maximum look-ahead timeframe and the variable defining the periodic basis into memory associated with the specialized computing device. The specialized computing device utilizes the plurality of variables indicating action history and transactions associated with the monitored account, the variable defining the maximum look-ahead timeframe, and the variable defining the periodic basis to derive one or more risk models associated with the monitored account. The one or more risk models describe risk associated with the monitored account according to the periodic basis up to the maximum look-ahead timeframe. The specialized computing device determines a risk level associated with the customer utilizing the one or more derived risk models. The one or more derived risk models and the determined risk level associated with the customer are utilized to generate a risk-driven campaign optimization strategy with the specialized computing device, considering the portfolio of monitored accounts. In an embodiment of the invention, the one or more communication channels comprise at least two communication channels and the risk-driven campaign optimization strategy is defined by an equation:
In an alternate embodiment, the risk-driven campaign optimization strategy comprises at least two sub-modules relating to single and multi-channel communications. The risk-driven campaign optimization strategy may be risk of delinquency reduction, cost optimization, and/or targeting.
The specialized computing device is utilized to generate a solution maximizing advantage considering the risk-driven campaign optimization strategy, the solution maximizing advantage including making a determination of whether to contact the customer, and, if so, determining which communication channel to utilize from the one or more communication channels to contact the customer, as well as determining a time t to contact the customer. In a further embodiment of the invention, when generating the solution maximizing advantage to the campaign optimization problem the specialized computing device factors the one or more derived risk models regarding one or more monitored accounts of the portfolio of monitored accounts to determine whether to contact the customer and which communications channel of the one or more communications channels to utilize to contact the customer.
If the specialized computing device determines a time t to contact the customer, the customer is contacted at time t utilizing the determined communication channel requesting at least a partial repayment of a loan associated with the monitored account. The specialized computing device may further receive and store into memory associated with the specialized computing device a time elapsed since a previous communication, a customer contact time preference factor, and a limiting factor limiting the number of communications sent to the customer, and utilize the time elapsed, the preference factor, and the limiting factor in generating the solution to the risk-driven campaign optimization strategy and making the determination whether to contact the customer.
In a further embodiment of the invention, the specialized computing device further determines a level of sensitivity the customer has to communications regarding the account and utilizes the determined level of sensitivity to determine whether to contact the customer at time t. Profits from contacting all customers associated with the portfolio of monitored accounts may be described by a formula, profit=Σt=1TΣi=1naijtpijt. The risk-driven campaign optimization strategy may be defined by an equation:
The goal of the invention is to recover a loan amount, reduce an initial loss, or reduce in some other way the cost of providing an account to an individual by communicating with the customer in the optimal way (i.e., considering the user given parameters and resource constraints). A communication made via a communications channel of one or more communications channels available has an inherent cost, but also provides inherent profit by actually recovering an amount from a customer. Profit is defined as from customer i with communication channel j at time t. The inherent profit equals pijt. The inherent cost is Cj. Profit (from a communication involving a single communications channel)=Σt=1TΣi=1naitpit.
The specific benefits of the invention including the receipt of strategic decision making by a specialized computing device for a contact center, allowing planning and execution of a multi-channel communications campaign. Such a campaign provides the maximum benefit when contacting customers by saving money from not making unnecessary communications or using overly expensive communications channels. The invention operates by taking into account the risk or behavioral propensity of each individual, therefore strategically planning in a unique way for each individual and for all the individuals together.
An embodiment of invention takes into account characteristics of the communication channel (costs, resources needed, etc.) and sequencing different kinds of communication (whether it is acceptable to follow-up communication using the same medium or not). An online simulation tool verifies the allocation of resources, and associated costs and visualization tools show the predicted effectiveness of a campaign. An embodiment of the invention, as further discussed here, proposes four different factors that are critical to the multi-channel action planning strategy, and a way to perform sensitivity analysis around these factors. Two problem formulations are proposed, based on these factors, and methods disclosed herein solve these formulations.
Note also, methods, systems, and apparatuses outlined in this invention allow dynamic planning for optimal action strategy in a single channel and multiple channel communication settings. A graphical display provides for the visualization of predicted optimal regimes of operation under various assumptions. Computational complexity for finding optimal regimes in an embodiment of the invention is O(nk log nk), where n is the number of customers and k is the number of channels. Every customer in a population and/or sub-group may be planned for, while taking into consideration the effectiveness of different means of communicating. Multiple different loading strategies are considered in the presently disclosed invention. Loading strategies, in an embodiment of the invention, are mathematical implementations of strategies which indicate a time or multiple time segments for which one or more communications are preferentially scheduled by the specialized computing device in a long service period between an account owner and account servicer. Also disclosed is an online mechanism including a simulation strategy, providing the optimal operational parameters under different loading strategies.
These and other aspects, objectives, features, and advantages of the disclosed technologies will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings.
Describing now in further detail these exemplary embodiments with reference to the figures as described above, the system, method, and apparatus for Efficient Methods for Predictive Action Strategy Optimization for Risk Driven Multi-Channel Communication is described below. It should be noted that the drawings are not to scale.
As used herein, a “communication channel” is defined as any manner of contacting a customer from a contact center or elsewhere. Examples of communication channels include telephone calls, e-mails, web-chats, instant messages, messages transmitted or posted via social media (e.g. Facebook®), text messages, facsimiles, letters, or any other presently existing or after-arising equivalent or equivalents allowing contact with a customer. A “communication” is of the type standard (as one of skill in the art would know) and utilized in connection with the above-discussed communication channels. In the presently disclosed invention, there is a non-zero cost for the use of a communication channel for transmitting one or more communications to an individual or group of individuals.
As used herein, certain variables are defined as follows. Variable index “i” denotes a customer. Variable “li” denotes a loan/liability value/account amount owed by a customer i. For simplicity, assume only one loan/liability value/account is assigned to one customer, but a formulation in an embodiment of the invention may be extended to multiple loans per customer, if desired. There are a total of “n” customers. Each loan/liability value/account has some risk associated with it, and the risk associated with each loan/liability value/account is denoted as ri, (i.e., the risk that the customer will not pay back the loan or the amount due on an account). For a given loan/liability value/account and risk profile, the initial loss to the lender is liri, assuming that no action is taken. A communication with a customer takes place at time T. The communication channel utilized is denoted with index j. Binary variable aijtε{0,1} denotes whether a customer i is contacted via communication channel j at time t or not. In an embodiment of the invention, aijt=1 indicates that customer is contacted at time t, while aijt=0 indicates the customer was not contacted at time t. Let variable Nijt be the number of communications that are performed with customer i using communication channel j at time interval T. Whenever a communication takes place, the inherent profit from the communication is defined as pijt, the profit from customer i with channel j at time t. Finally, note that there is always cost associated with making a communication, defined as Cj. It is assumed herein that cost is constant and unchanging. In the context of the presently disclosed invention, “loan,” “liability value,” and “account amount” are used interchangeably.
An “account” (within the context of this and associated patent applications) is a record of debt (typically, debt issued for or resulting from a specific purpose such as a payment for school tuition, mortgaging or refinancing a house, purchasing an automobile, payments for medical/dental services rendered, payments for utility services, paying off a credit card, payments for goods and/or services from a merchant, upcoming medical screening or vaccination scheduling, etc.), although any necessary repayment of debt qualifies. Accounts may have zero or more “financial transactions” associated with them, financial transactions including but not limited to issuance of the associated debt, payments made and applied, credits applied, late charges issued, monthly interest compounded, etc. The “action history” associated with an account is a history of financial transactions, including initial account amounts, payments made, dates associated with payments, payments missed, late charges charged, late charges paid, late charges waived, etc. An account contains one or more of the following (depending on the nature and particulars of the account): principal amount, interest rate, terms of repayment, date(s) of repayment made, date(s) of required payment(s), date(s) of missed payment(s), amount of required payment(s), date(s) of service rendered, etc. As discussed within, this patent application and associated patent applications, an account and an associated account history exist in a format accessible to a specialized computing device for processing such as a spreadsheet, .csv value, matrix (as defined by programming languages utilizing matrices), an array, a database entry, a linked-list, a tree-structure, other types of computer files or variables (or any other presently existing or after-arising equivalent). Variables tracked include (if appropriate), but are not limited to, the origination/initiation date of the account, dates of goods/services provided, the original amount of the account balance, the remaining principle balance to be paid, the date(s) of the payment(s) made, date(s) of payment(s) due, the current interest rate, the terms of repayment, total number of original monthly payment(s), number of remaining monthly payment(s), whether each monthly payment was timely (true/false), number day(s) delinquent of every monthly payment (from 0-integer), credit score of account holder at various points in time, original goods/services provided, etc. In a further embodiment of the invention, variables further include account status (is) (current or not), delinquency day(s) (dd), and forbearance month(s) (fm).
A “specialized computing device,” as discussed in the context of this patent application and related patent applications, refers to one or multiple computer processors acting together, a logic device or devices, an embedded system or systems, or any other device or devices allowing for programming and decision making. The specialized computing device discussed herein may manage a “contact center,” as further discussed below. Multiple computer systems with associated specialized computing devices may also be networked together in a local-area network or via the internet to perform the same function, and are therefore also a “specialized computing device” for the reasons discussed herein. In one embodiment, a specialized computing device may be multiple processors or circuitry performing discrete tasks in communication with each other. The system, method, and apparatus described herein are implemented in various embodiments as, to execute on a “specialized computing device[s],” or, as is commonly known in the art, such a device specially programmed in order to perform a task at hand. A specialized computing device is a necessary element to process the large amount of data (i.e. thousands, tens of thousands, hundreds of thousands, or more of accounts and account histories). Furthermore, the present invention may take the form of a computer program product embodied in any tangible medium of expression having computer usable program code embodied in the medium. Computer program code for carrying out operations of the present invention may operate on any or all of the “specialized computing device,” and/or a “server,” “computing device,” “computer device,” or “system” discussed herein. Computer program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object-oriented programming language such as Java, Smalltalk, C++, or the like, conventional procedural programming languages, such as Visual Basic, “C,” or similar programming languages. After-arising programming languages are contemplated as well.
A “contact center,” as discussed in the context of this patent application and related patent applications, refers to a facility, group of facilities, or other physical arrangement to manage customer contact using any and/or all of the communication channels as further discussed herein for a business, company, charity, or any other organization of individuals. A “call center” is an example of a type of contact center which focuses on utilization of telephones to contact customers.
With regard to certain notations and variables as used herein, note the following: elapsed time is denoted ∇tc, with c denoting a call. Elapsed time is the elapsed time since a last call. It is based on an observation that the more time has elapsed from the last call, the more effective the current call is, but note elapsed time should not be so much that the customer forgets the previous call. The elapsed time since the last contact is considered directly, i.e. that effectiveness of the call is exponentially increasing as a function of elapsed time. The elapsed time since the last call may also be measured as an inequality, and should not be so high as to allow the customer to forget the previous call. If the time difference is too high, the customer is not contacted enough times over a time-span. ∇tc=t−tic, where t is the current time and while tic is the time when the last call was made to customer i. The loading factor is denoted with φi(t). The loading factor determines how and generally when different customers are contacted. Some customers prefer to be called in the early phase of default (front loading), while other customers prefer to be called in the latter phase of default (back loading). The loading factor plays a role in determining how and when a customer is contacted, in an embodiment of the invention. The loading factor is a function of time which denotes how to discount the elapsed time as the time progresses. The preference factor is denoted by Bj. The preference factor is based upon the presumption that not all communication channels get the same preference from customers themselves. Some communication channels are preferred over others, e.g. e-mails are preferred over calls, etc. The preference factor acts similar to the loading factor, in that it increases or decreases the effective elapsed time between contacts. Unlike the loading factor, the preference factor remains constant with respect to time, and only changes as based upon the communication channel. In an embodiment, the preference factor changes with each customer, but in a simplified embodiment the preference factor is assumed to be the same for all customers. The limiting factor is denoted using variable γijτ. The limiting factor limits the number of communications that may be sent to a customer. In practice, one cannot call or send e-mails indefinitely to a customer because after a certain time, the effect of the e-mail or call diminishes, i.e. after a certain time, the customer would not pay the money back, no matter how many times he/she is contacted. This limiting factor precisely models that. The benefit from any single call typically reduces as the number of calls increases. This is modelled by an exponential term. The limiting factor depends on the number of communications made to a customer so far, so if Nijτ is the number of communications made until time interval τ, i.e. e−μ
Referring to
Considering the above factors, in an embodiment of the invention the effectiveness of a call fit (or other communication) is modelled in the following way (for only one channel):
Also considering the above factors, in a further embodiment of the invention, for multiple channels the function is written by including an index for channel, i.e. j:
The first general way of determining assignments given the assignment variables is focused upon here. For the case when there is only one channel, the optimization problem, by considering one time step at a time, is written as follows:
(where Nc is the capacity constraint i.e. the number of calls that a contact center may handle at any given time).
The algorithm to solve the above optimization problem, Algorithm 1, is provided below, and is based on sorting of scores. In each time step, scores are computed for all customers (by considering the times difference from the previous time the customers were called) and then these scores are sorted. The score is, in effect, nothing but profit pit. From the sorted list, the top Nc customers make their assignment variables 1. The assignment variables for the rest of the customers are set to 0. This process is repeated until the end of time T. The computational complexity of Algorithm 1 is O(Tn log n):
Continuing, the above formulation may be extended for multiple channels by considering the channel index j, and the preference factor Bj. The objection function here is:
(where μj, as stated earlier, depends on the preference factor Bj. Here, μj is computed by first inverting Bj, i.e. 1/Bj, and then normalizing it.)
There are three constraints in the above optimization problem. The first constraint is the capacity constraint which is used because there are limitations on the number of communications that may be handled by a communication center at any given time. The second constraint is used to make sure that at any given time, a customer is only contacted using one channel. The third constraint is simply the binary constraint for the assignment variables.
The algorithm to solve the above optimization problem is provided below, Algorithm 2. This algorithm is similar to the previous algorithm, i.e. it is also based on sorting the scores. The score for all customers for all channels is computed here. This provides multiple lists of scores, each list belonging to one channel. These scores are sorted, combining all lists into a single list. The next step is to iterate over the combined list, and set the assignment variable corresponding to the score to 1. Continue iterating until the capacity of all channels is exhausted. The process is repeated until the end of the time T. The computational complexity of the Algorithm 2 is O(Tnk log(nk)), where k is the total number of channels.
At step 180, the specialized computing device is utilized to generate a solution maximizing advantage considering the risk-driven campaign optimization strategy, the solution maximizing advantage including making a determination of whether to contact the customer, and, if so, determining which communication channel to utilize from the one or more communication channels to contact the customer and determining a time t to contact the customer. In effect, in determining whether to communicate with a customer at a particular time or not, the specialized computing device is determining the assignment of aijt. Total profit from contacting all customers is described by an equation: profit=Σt=1TΣi=1naijtpijt.
In an embodiment of the invention at step 180, only one communication channel is considered, and merely the time t is determined. In such an embodiment, variables discussed herein pijt becomes pit, aijt becomes ait, and so on. Index j may be replaced with c, where c stands for calls. The goal of a further embodiment of the invention is maximizing profits through communicating with customers. Total profit over a period of time is described by the equation: profit=Σt=1TΣi=1naijtpijt, where pit is the profit from one customer. If seeking maximization of profits, there are multiple ways that the profit term pit may be modeled. One such example is in terms of the fraction of the initial amount (liri) that a particular contact may be expected to return. The profit from all calls may be written profit=Σt=1TΣi=1naitlirifit, where fit is the fraction of the initial amount.
Considering the above, in an embodiment of the invention, as discussed previously, the effectiveness of a call fit (or other communication) is modelled in the following way (for only one channel):
Here h(.) is a step function i.e. h(∇tij)=1(∇t
This means that when the discounted time elapsed is 0, the communication is almost ineffective while if the time elapsed becomes very large, the communication would be very effective. Both of these constraints are satisfied by fit. The above function is only for one single channel.
In a further embodiment of the invention, as discussed previously, for multiple channels the function is written by including an index for channel i.e. j:
Here ∇tij=t−tii, with t being the current time, tii being the time when customer i was contacted by channel j. Notice the preference factor Bj in the multiple channel function, which was not there in the simple channel function. Here, it is assumes that a loading strategy is given. In case the loading strategy is not given, it may be computed using other models (personalized behaviour model). For the sake of the presently disclosed invention, the following loading strategies are considered:
1. Uniform: φi(t)=constant
2. Front Loading: φi(t)=rieτ
3. Back Loading: φi(t)=1−rieτ
Here τ=t−0 is the time interval from the beginning of the time.
After step 180, execution ends 199, or execution proceeds to step 190. At step 190 the specialized computing device, when generating the solution maximizing advantage to the campaign optimization problem factors the one or more derived risk models regarding one or more monitored accounts of the portfolio of monitored accounts to determine whether to contact the customer and which communications channel of the one or more communications channels to utilize to contact the customer. After step 190, execution terminates 199.
Referring to
Referring to
Referring generally to
Referring more specifically to
Referring to
Referring to
Referring to
Referring to
Referring to
Note that the optimal point of this plot displayed in
Referring now to
Referring now to
The preceding description has been presented only to illustrate and describe the invention. It is not intended to be exhaustive or to limit the invention to any precise form disclosed. Many modifications and variations are possible in light of the above teachings.
As will be appreciated by one of skill in the art, the presently disclosed invention is intended to comply with all relevant local, city, state, federal, and international rules regarding the collection of debts, and otherwise.
The preferred embodiments were chosen and described in order to best explain the principles of the invention and its practical application. The preceding description is intended to enable others skilled in the art to best utilize the invention in its various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims.