# US 2019/0356781 A1 · Techniques for estimating expected performance in a task assignment system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0356781 A1
- Document ID: US20190356781A1
- Status: Published application
- Kind: A1
- Application number: 16/527,588
- Filed: 2019-07-31
- Published: 2019-11-21
- Earliest claimed: 2017-07-10
- Assignees: Afiniti Europe Technologies Limited
- Applicants: Afiniti Europe Technologies Limited
- Inventors: Zia CHISHTI; Ittai KAN; Vikash KHATRI
- Web page: https://patentgrep.com/patent/US20190356781A1

## CPC

- H04M 3/5232: {Call distribution algorithms}
- G06Q 10/06311: {Scheduling, planning or task assignment for a person or group}
- H04M 3/5175: {Call or contact centers supervision arrangements}
- H04M 2203/401: Performance feedback
- H04M 2203/402: Agent or workforce management
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Techniques for estimating expected performance of a task assignment strategy in a task assignment system are disclosed. In one particular embodiment, the techniques may be realized as a method comprising receiving, by at least one computer processor communicatively coupled to a task assignment system, a plurality of historical agent task assignments; determining, by the at least one computer processor, a sample of the plurality based on a strategy for pairing agents with tasks; determining, by the at least one computer processor, an expected performance of the strategy based on the sample; outputting, by the at least one computer processor, the expected performance; and optimizing, by the at least one computer processor, the performance of the task assignment system based on the expected performance.

## Claims

### Claim 1

A method for validating a preferred task assignment strategy in a task assignment system comprising:
receiving, by at least one computer processor communicatively to and configured to perform task assignment operations in the task assignment system, an average size of a task queue or an average number of available agents;
determining, by the at least one computer processor, an expected average amount of choice based on the average size of the task queue or the average number of available agents;
determining, by the at least one computer processor, a first estimated performance level of the task assignment system using the preferred task assignment strategy based on the expected average amount of choice; and
establishing, in a switch of the task assignment system, a connection between a task and an agent based upon the preferred task assignment strategy.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining, by the at least one computer processor, a second estimated performance level of the task assignment system using the preferred task assignment strategy based on an optimum amount of choice; and
outputting, by the at least one computer processor, a difference between the first and second estimated performance levels of the task assignment system.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
recommending, by the at least one computer processor, an agent workforce increase, wherein the agent workforce increase is expected to increase an expected average number of available agents to increase the expected average amount of choice to increase the first estimated performance level.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
recommending, by the at least one computer processor, an agent workforce decrease, wherein the agent workforce decrease is expected to increase the average size of the task queue to increase the expected average amount of choice to increase the first estimated performance level.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
delaying, by the at least one computer processor, establishing connections among at least one waiting task and at least one available agent, wherein the delaying is expected to increase an actual amount of choice to increase an actual performance level of the task assignment system.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
receiving, by the at least one computer processor, a first plurality of historical agent-task assignments, wherein each of the first plurality of historical agent-task assignments includes a historical size of the task queue or a historical number of available agents at the time of the each of the first plurality of historical agent-task assignments; and
outputting, by the at least one computer processor, a frequency distribution of varying amounts of choice over time based on the historical size of the task queue or the historical number of available agents of the each of the first plurality of historical agent-task assignments.

### Claim 7 (depends on 1)

The method of claim 1, wherein the preferred task assignment strategy is a behavioral pairing strategy.

### Claim 8 (depends on 7)

The method of claim 7, wherein the behavioral pairing strategy is a diagonal model behavioral pairing strategy or a network-flow behavioral pairing strategy.

### Claim 9

A system for validating a preferred task assignment strategy in a task assignment system comprising:
at least one computer processor communicatively coupled to and configured to perform task assignment operations in the task assignment system, wherein the at least one computer processor is further configured to:
receive an average size of a task queue or an average number of available agents;
determine an expected average amount of choice based on the average size of the task queue or the average number of available agents;
determine a first estimated performance level of the task assignment system using the preferred task assignment strategy based on the expected average amount of choice; and
establish a connection between a task and an agent based upon the preferred task assignment strategy.

### Claim 10 (depends on 9)

The system of claim 9, wherein the at least one computer processor is further configured to:
determine a second estimated performance level of the task assignment system using the preferred task assignment strategy based on an optimum amount of choice; and
output a difference between the first and second estimated performance levels of the task assignment system.

### Claim 11 (depends on 9)

The system of claim 9, wherein the at least one computer processor is further configured to:
recommend an agent workforce increase, wherein the agent workforce increase is expected to increase an expected average number of available agents to increase the expected average amount of choice to increase the first estimated performance level.

### Claim 12 (depends on 9)

The system of claim 9, wherein the at least one computer processor is further configured to:
recommend an agent workforce decrease, wherein the agent workforce decrease is expected to increase the average size of the task queue to increase the expected average amount of choice to increase the first estimated performance level.

### Claim 13 (depends on 9)

The system of claim 9, wherein the at least one computer processor is further configured to:
delay establishing connections among at least one waiting task and at least one available agent, wherein the delaying is expected to increase an actual amount of choice to increase an actual performance level of the task assignment system.

### Claim 14 (depends on 9)

The system of claim 9, wherein the at least one computer processor is further configured to:
receive a first plurality of historical agent-task assignments, wherein each of the first plurality of historical agent-task assignments includes a historical size of the task queue or a historical number of available agents at the time of the each of the first plurality of historical agent-task assignments; and
output a frequency distribution of varying amounts of choice over time based on the historical size of the task queue or the historical number of available agents of the each of the first plurality of historical agent-task assignments.

### Claim 15

An article of manufacture for validating a preferred task assignment strategy in a task assignment system comprising:
a non-transitory processor readable medium; and
instructions stored on the medium;
wherein the instructions are configured to be readable from the medium by at least one computer processor communicatively coupled to and configured to perform task assignment operations in the task assignment system and thereby cause the at least one computer processor to operate so as to:
receive an average size of a task queue or an average number of available agents;
determine an expected average amount of choice based on the average size of the task queue or the average number of available agents;
determine a first estimated performance level of the task assignment system using the preferred task assignment strategy based on the expected average amount of choice; and
establish a connection between a task and an agent based upon the preferred task assignment strategy.

### Claim 16 (depends on 15)

The article of manufacture of claim 15, wherein the at least one computer processor is further configured to:
determine a second estimated performance level of the task assignment system using the preferred task assignment strategy based on an optimum amount of choice; and
output a difference between the first and second estimated performance levels of the task assignment system.

### Claim 17 (depends on 15)

The article of manufacture of claim 15, wherein the at least one computer processor is further configured to:
recommend an agent workforce increase, wherein the agent workforce increase is expected to increase an expected average number of available agents to increase the expected average amount of choice to increase the first estimated performance level.

### Claim 18 (depends on 15)

The article of manufacture of claim 15, wherein the at least one computer processor is further configured to:
recommend an agent workforce decrease, wherein the agent workforce decrease is expected to increase the average size of the task queue to increase the expected average amount of choice to increase the first estimated performance level.

### Claim 19 (depends on 15)

The article of manufacture of claim 15, wherein the at least one computer processor is further configured to:
delay establishing connections among at least one waiting task and at least one available agent, wherein the delaying is expected to increase an actual amount of choice to increase an actual performance level of the task assignment system.

### Claim 20 (depends on 15)

The article of manufacture of claim 15, wherein the at least one computer processor is further configured to:
receive a first plurality of historical agent-task assignments, wherein each of the first plurality of historical agent-task assignments includes a historical size of the task queue or a historical number of available agents at the time of the each of the first plurality of historical agent-task assignments; and
output a frequency distribution of varying amounts of choice over time based on the historical size of the task queue or the historical number of available agents of the each of the first plurality of historical agent-task assignments.
