Techniques for estimating expected performance in a task assignment system

US10999439B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10999439-B2
Application numberUS-202016930624-A
CountryUS
Kind codeB2
Filing dateJul 16, 2020
Priority dateJul 10, 2017
Publication dateMay 4, 2021
Grant dateMay 4, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method comprising: receiving, by at least one computer processor communicatively coupled to and configured to perform contact-agent pairing operations in a contact center system, a plurality of contact types; receiving, by the at least one computer processor, a plurality of agent sets; receiving, by the at least one computer processor, a first plurality of contact-agent interaction sets and associated outcomes; generating, by the at least one computer processor, a plurality of weights based on the first plurality of contactagent interaction sets, the plurality of contact types, and the plurality of agent sets; receiving, by the at least one computer processor, a second plurality of contact-agent interaction sets and associated outcomes; applying, by the at least one computer processor, the plurality of weights to the second plurality of contact-agent interaction sets; and estimating, by the at least one computer processor, a performance of a pairing strategy based on the applying, wherein the pairing strategy is configured to cause a connection to be established between a contact and an agent in a switch of the contact center system. 2. The method of claim 1 , wherein the plurality of weights consists of 0 and 1. 3. The method of claim 1 , wherein the pairing strategy is a behavioral pairing strategy. 4. The method of claim 3 , wherein the behavioral pairing strategy is a diagonal pairing strategy. 5. The method of claim 1 , wherein the first and second pluralities of contact-agent interaction sets are not identical. 6. The method of claim 1 , wherein the plurality of weights is based on a target utilization of at least one agent set of the plurality of agent sets. 7. The method of claim 1 , wherein each of the plurality of weights represents a closeness of fit to the pairing strategy. 8. The system of claim 1 , wherein the plurality of weights consists of 0 and 1. 9. The system of claim 1 , wherein the pairing strategy is a behavioral pairing strategy. 10. The system of claim 9 , wherein the behavioral pairing strategy is a diagonal pairing strategy. 11. The system of claim 1 , wherein the first and second pluralities of contact-agent interaction sets are not identical. 12. The system of claim 1 , wherein the plurality of weights is based on a target utilization of at least one agent set of the plurality of agent sets. 13. The system of claim 1 , wherein each of the plurality of weights represents a closeness of fit to the pairing strategy. 14. A system comprising: at least one computer processor communicatively coupled to and configured to perform contact-agent pairing operations in a contact center system, wherein the at least one computer processor is further configured to: receive a plurality of contact types; receive a plurality of agent sets; receive a first plurality of contact-agent interaction sets and associated outcomes; generate a plurality of weights based on the first plurality of contact-agent interaction sets, the plurality of contact types, and the plurality of agent sets; receive a second plurality of contact-agent interaction sets and associated outcomes; apply the plurality of weights to the second plurality of contact-agent interaction sets; and estimate a performance of a pairing strategy based on the applying, wherein the pairing strategy is configured to cause a connection to be established between a contact and an agent in a switch of the contact center system. 15. An article of manufacture comprising: a non-transitory computer 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 contact-agent pairing operations in a contact center system and thereby cause the at least one computer processor to operate so as to: receive a plurality of contact types; receive a plurality of agent sets; receive a first plurality of contact-agent interaction sets and associated outcomes; generate a plurality of weights based on the first plurality of contact-agent interaction sets, the plurality of contact types, and the plurality of agent sets; receive a second plurality of contact-agent interaction sets and associated outcomes; apply the plurality of weights to the second plurality of contact-agent interaction sets; and estimate a performance of a pairing strategy based on the applying, wherein the pairing strategy is configured to cause a connection to be established between a contact and an agent in a switch of the contact center system. 16. The article of manufacture of claim 15 , wherein the plurality of weights consists of 0 and 1. 17. The article of manufacture of claim 15 , wherein the pairing strategy is a behavioral pairing strategy. 18. The article of manufacture of claim 17 , wherein the behavioral pairing strategy is a diagonal pairing strategy. 19. The article of manufacture of claim 15 , wherein the first and second pluralities of contact-agent interaction sets are not identical. 20. The article of manufacture of claim 15 , wherein the plurality of weights is based on a target utilization of at least one agent set of the plurality of agent sets. 21. The article of manufacture of claim 15 , wherein each of the plurality of weights represents a closeness of fit to the pairing strategy.

Assignees

Inventors

Classifications

  • Call or contact centers supervision arrangements · CPC title

  • Performance feedback · CPC title

  • Agent or workforce management · CPC title

  • H04M3/5232Primary

    Call distribution algorithms · CPC title

  • G06Q10/04Primary

    Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10999439B2 cover?
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 pr…
Who is the assignee on this patent?
Afiniti Europe Tech Ltd, Afiniti Ltd
What technology area does this patent fall under?
Primary CPC classification H04M3/5232. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue May 04 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 6 related publications on this page (citations in our corpus or others sharing the same primary CPC).