Probability multiplier process for call center routing
First Claim
1. A computer-implemented method for routing callers to agents in a call-center routing environment, the method comprising:
- identifying, by one or more computers, caller data for each of a set of waiting callers including multiple data items from one or more of the group of demographic data and psychographic data of the caller;
identifying, by the one or more computers, agent data for a set of agents including multiple data items from one or more of the group of demographic data and a psychographic data;
determining, by one or more computers, agent performance of the set of agents for an outcome variable, wherein the agent performance comprises a respective relative ranking for each of two or more of the set of agents for at least the variable outcome of revenue generation;
determining, by the one or more computers, caller propensity of the set of waiting callers for the outcome variable, wherein the caller propensity comprises a respective relative ranking for each of two or more of the set of waiting callers for the outcome variable of revenue generation;
using a multi-data element pattern matching algorithm, by the one or more computers, to create a model that matches each agent of the set of agents to each caller of the set of waiting callers, in a pair-wise fashion to determine a potential for the outcome variable for each agent-caller match; and
matching and routing, by the one or more computers, one of the waiting callers to one of the agents based at least in part on the relative ranking of the one agent in relation to the relative ranking of the one waiting caller and the potential for the outcome variable for this agent-caller match from the multi-data element pattern matching algorithm.
9 Assignments
0 Petitions
Accused Products
Abstract
Systems and processes are disclosed for routing callers to agents in a contact center based on similar probabilities for an outcome variable. An exemplary probability multiplier process includes determining agent performance of a set of agents for an outcome variable (e.g., sales) and determining caller propensity of a set of callers for the outcome variable (e.g., the propensity or statistical chance of purchasing). Callers and agents are matched based on corresponding agent performance and propensity for the outcome variable of the caller, e.g., matching callers and agents having similar relative performance for the outcome variable, such as matching the highest ranked caller to the highest ranked agent, the worst ranked caller to the worst ranked agent, and so on. The performance and propensity of the callers and agents may be converted to percentile rankings, and callers and agents can be matched based on a closest match of percentile rankings.
-
Citations
38 Claims
-
1. A computer-implemented method for routing callers to agents in a call-center routing environment, the method comprising:
-
identifying, by one or more computers, caller data for each of a set of waiting callers including multiple data items from one or more of the group of demographic data and psychographic data of the caller; identifying, by the one or more computers, agent data for a set of agents including multiple data items from one or more of the group of demographic data and a psychographic data; determining, by one or more computers, agent performance of the set of agents for an outcome variable, wherein the agent performance comprises a respective relative ranking for each of two or more of the set of agents for at least the variable outcome of revenue generation; determining, by the one or more computers, caller propensity of the set of waiting callers for the outcome variable, wherein the caller propensity comprises a respective relative ranking for each of two or more of the set of waiting callers for the outcome variable of revenue generation; using a multi-data element pattern matching algorithm, by the one or more computers, to create a model that matches each agent of the set of agents to each caller of the set of waiting callers, in a pair-wise fashion to determine a potential for the outcome variable for each agent-caller match; and matching and routing, by the one or more computers, one of the waiting callers to one of the agents based at least in part on the relative ranking of the one agent in relation to the relative ranking of the one waiting caller and the potential for the outcome variable for this agent-caller match from the multi-data element pattern matching algorithm. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method for routing callers to agents in a call-center routing environment, the method comprising:
-
identifying, by one or more computers, caller data for each of a set of waiting callers including multiple data items from one or more of the group of demographic data and psychographic data of the caller; identifying, by the one or more computers, agent data for a set of agents including multiple data items from one or more of the group of demographic data and psychographic data; determining, by one or more computers, agent performance of the set of agents for a first outcome variable, wherein the agent performance comprises a respective relative ranking for each of two or more of the set of agents for at least the first variable outcome; determining, by the one or more computers, caller propensity of the set of callers for a second outcome variable, wherein the caller propensity comprises a respective relative ranking for each of two or more of the set of waiting callers for the second outcome variable; using a multi-data element pattern matching algorithm, by the one or more computers, to create a model that matches each agent of the set of agents to each caller of the set of waiting callers, in a pair-wise fashion to determine a potential for the first outcome variable and the second outcome variable for each agent-caller match; and matching and routing, by the one or more computers, one of the waiting callers to one of the agents based at least in part on the relative ranking of the one agent in relation to the relative ranking of the one waiting caller and the potential for the outcome variable for this agent-caller match from the multi-data element pattern matching algorithm. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A non-transitory computer-readable storage medium comprising computer-readable instructions for matching, when executed, to agents based on predicted outcome performance, the computer readable instructions comprising:
-
identifying, by one or more computers, caller data for each of a set of waiting callers including multiple data items from one or more of the group of demographic data and psychographic data of the caller; identifying, by the one or more computers, agent data for a set of agents including multiple data items from one or more of the group of demographic data and psychographic data; determining, by one or more computers, agent performance of the set of agents for an outcome variable, wherein the agent performance comprises a respective relative ranking for each of two or more of the set of agents for at least the variable outcome of revenue generation; determining, by the one or more computers, caller propensity of the set of waiting callers for the outcome variable, wherein the caller propensity comprises a respective relative ranking for each of two or more of the set of waiting callers for the outcome variable of revenue generation; using a multi-data element pattern matching algorithm, by the one or more computers, to create a model that matches each agent of the set of agents to each caller of the set of waiting callers, in a pair-wise fashion to determine a potential for the outcome variable for each agent-caller match; and matching and routing, by the one or more computers, one of the waiting callers to one of the agents based at least in part on the relative ranking of the one agent in relation to the relative ranking of the one waiting caller and the potential for the outcome variable for this agent-caller match from the multi-data element pattern matching algorithm. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31)
-
-
32. A system for routing callers to agents in a call center routing environment based on predicted outcome performance, the system comprising one or more computers configured with computer-readable instructions to perform, when executed, the steps:
-
identifying, by one or more computers, caller data for each of a set of waiting callers including multiple data items from one or more of the group of demographic data and psychographic data of the caller; identifying, by the one or more computers, agent data for a set of agents including multiple data items from one or more of the group of demographic data and psychographic data; determining, by the one or more computers, agent performance of the set of agents for an outcome variable, wherein the agent performance comprises a respective relative ranking for each of two or more of the set of agents for at least the variable outcome of revenue generation; determine, by the one or more computers, caller propensity of the set of waiting callers for the outcome variable, wherein the caller propensity comprises a respective relative ranking for each of two or more of the set of waiting callers for the outcome variable of revenue generation; using a multi-data element pattern matching algorithm, by the one or more computers, to create a model that matches each agent of the set of agents to each caller of the set of waiting callers, in a pair-wise fashion to determine a potential for the outcome variable for each agent-caller match; and matching and routing, by the one or more computers, one of the waiting callers to one of the agents based at least in part on the relative ranking of the one agent in relation to the relative ranking of the one waiting caller and the potential for the outcome variable for this agent-caller match from the multi-data element pattern matching algorithm. - View Dependent Claims (33, 34, 35, 36, 37, 38)
-
Specification