IP Library › Granted Patent US 12,307,292
Granted Patent B2
US 12,307,292 · App. 17/167,429 · Granted May 20, 2025

Techniques for pairing in a task assignment system with an external pairing system

Inventor: Ain Chishty (Rockville, MD)
Assignee: Afiniti AI Limited
G06F9/4887G06F9/541
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,307,292
App. No.
17/167,429
Granted
May 20, 2025
Kind
B2
Abstract

Techniques for pairing in a task assignment system with an external pairing system are disclosed. In one particular embodiment, the techniques may be realized as a method for pairing in a task assignment system with an external pairing system comprising transmitting first information that identifies one or more tasks waiting for assignment and one or more agents available for assignment; transmitting a pairing request; determining an initial timeout window to wait for the external pairing system to respond to the pairing request; receiving at a first time within the initial timeout window, an extension request that includes an instruction to extend the initial timeout window; extending the initial timeout window in response to the receiving the extension request; and receiving at a second time within the extended timeout window, a pairing response that includes a selected pairing between the one or more tasks and the one or more agents.

Claims (110)

1. A method for pairing in a task assignment system with an external pairing system, the method comprising:

transmitting, by at least one computer processor communicatively coupled to and configured to operate in the task assignment system, to the external pairing system over an application programming interface, first information that identifies one or more tasks waiting for assignment in a switch of the task assignment system and one or more agents available for assignment in the switch of the task assignment system, wherein the external pairing system is configured to execute at least one pairing strategy based at least in part on at least one artificial intelligence model that increases overall performance of the task assignment system relative to an internal pairing system of the task assignment system, wherein the application programming interface at least partially isolates the external pairing system from other portions of the task assignment system and controls information exchanged between the external pairing system and the other portions of the task assignment system;

transmitting, by the at least one computer processor, to the external pairing system over the application programming interface, a pairing request;

determining, by the at least one computer processor, an initial timeout window to wait for the external pairing system to respond to the pairing request;

receiving, by the at least one computer processor, from the external pairing system, at a first time within the initial timeout window, an extension request that includes an instruction to extend the initial timeout window;

extending, by the at least one computer processor, the initial timeout window in response to the receiving the extension request;

receiving, by the at least one computer processor, from the external pairing system, at a second time within the extended timeout window, a pairing response that includes a selected pairing between the one or more tasks and the one or more agents, wherein the selected pairing is a result of executing the at least one pairing strategy; and

causing, by the at least one computer processor, the one or more tasks to be routed to the one or more agents in the switch of the task assignment system based at least in part upon the selected pairing;

wherein the external pairing system has access to less information associated with the switch of the task assignment system and less control over operations of the switch relative to the internal pairing system of the task assignment system.

2. The method of claim 1 , wherein the task assignment system is a contact center system.

3. The method of claim 1 , wherein the selected pairing is selected according to a behavioral pairing strategy.

4. The method of claim 1 , wherein the initial timeout window is extended by a predetermined duration of time.

5. The method of claim 1 , wherein the initial timeout window is extended until a number of pairing choices exceeds a predetermined threshold.

6. The method of claim 1 , wherein the initial timeout window is extended until the task assignment system transitions to an L3 environment.

7. The method of claim 1 , wherein the initial timeout window is extended based on information included in the extension request.

8. The method of claim 1 , further comprising transmitting, by the at least one computer processor, to the external pairing system, during the extended timeout window, updated information identifying the one or more tasks and the one or more agents, the updated information identifying a greater number of tasks, a greater number of agents, or a greater number of tasks and a greater number of agents than the first information.

9. The method of claim 1 , further comprising routing a task among the one or more tasks to an agent among the one or more agents in accordance with the selected pairing.

10. A system for pairing in a task assignment system with an external pairing system comprising:

at least one computer processor communicatively coupled to and configured to operate in the task assignment system, wherein the at least one computer processor is further configured to:

transmit, to the external pairing system over an application programming interface, first information that identifies one or more tasks waiting for assignment in a switch of the task assignment system and one or more agents available for assignment in the switch of the task assignment system, wherein the external pairing system is configured to execute at least one pairing strategy based at least in part on at least one artificial intelligence model that increases overall performance of the task assignment system relative to an internal pairing system of the task assignment system, wherein the application programming interface at least partially isolates the external pairing system from other portions of the task assignment system and controls information exchanged between the external pairing system and the other portions of the task assignment system;

transmit, to the external pairing system over the application programming interface, a pairing request;

determine an initial timeout window to wait for the external pairing system to respond to the pairing request;

receive, from the external pairing system, at a first time within the initial timeout window, an extension request that includes an instruction to extend the initial timeout window;

extend the initial timeout window in response to the receiving the extension request;

receive, from the external pairing system, at a second time within the extended timeout window, a pairing response that includes a selected pairing between the one or more tasks and the one or more agents, wherein the selected pairing is a result of executing the at least one pairing strategy; and

cause the one or more tasks to be routed to the one or more agents in the switch of the task assignment system based at least in part upon the selected pairing;

wherein the external pairing system has access to less information associated with the switch of the task assignment system and less control over operations of the switch relative to the internal pairing system of the task assignment system.

11. The system of claim 10 , wherein the task assignment system is a contact center system.

12. The system of claim 10 , wherein the selected pairing is selected according to a behavioral pairing strategy.

13. The system of claim 10 , wherein the initial timeout window is extended by a predetermined duration of time.

14. The system of claim 10 , wherein the initial timeout window is extended until a number of pairing choices exceeds a predetermined threshold.

15. The system of claim 10 , wherein the initial timeout window is extended until the task assignment system transitions to an L3 environment.

16. The system of claim 10 , wherein the initial timeout window is extended based on information included in the extension request.

17. The system of claim 10 , wherein the at least one computer processor is further configured to transmit, to the external pairing system, during the extended timeout window, updated information identifying the one or more tasks and the one or more agents, the updated information identifying a greater number of tasks, a greater number of agents, or a greater number of tasks and a greater number of agents than the first information.

18. The system of claim 10 , wherein the at least one computer processor is further configured to route a task among the one or more tasks to an agent among the one or more agents in accordance with the selected pairing.

19. An article of manufacture for pairing in a task assignment system with an external pairing 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 operate in the task assignment system and thereby cause the at least one computer processor to operate so as to:

transmit, to the external pairing system over an application programming interface, first information that identifies one or more tasks waiting for assignment in a switch of the task assignment system and one or more agents available for assignment in the switch of the task assignment system, wherein the external pairing system is configured to execute at least one pairing strategy based at least in part on at least one artificial intelligence model that increases overall performance of the task assignment system relative to an internal pairing system of the task assignment system, wherein the application programming interface at least partially isolates the external pairing system from other portions of the task assignment system and controls information exchanged between the external pairing system and the other portions of the task assignment system;

transmit, to the external pairing system over the application programming interface, a pairing request;

determine an initial timeout window to wait for the external pairing system to respond to the pairing request;

receive, from the external pairing system, at a first time within the initial timeout window, an extension request that includes an instruction to extend the initial timeout window;

extend the initial timeout window in response to the receiving the extension request;

receive, from the external pairing system, at a second time within the extended timeout window, a pairing response that includes a selected pairing between the one or more tasks and the one or more agents, wherein the selected pairing is a result of executing the at least one pairing strategy; and

cause the one or more tasks to be routed to the one or more agents in the switch of the task assignment system based at least in part upon the selected pairing;

wherein the external pairing system has access to less information associated with the switch of the task assignment system and less control over operations of the switch relative to the internal pairing system of the task assignment system.

20. The article of manufacture of claim 19 , wherein the task assignment system is a contact center system.

21. The article of manufacture of claim 19 , wherein the selected pairing is selected according to a behavioral pairing strategy.

22. The article of manufacture of claim 19 , wherein the initial timeout window is extended by a predetermined duration of time.

23. The article of manufacture of claim 19 , wherein the initial timeout window is extended until a number of pairing choices exceeds a predetermined threshold.

24. The article of manufacture of claim 19 , wherein the initial timeout window is extended until the task assignment system transitions to an L3 environment.

25. The article of manufacture of claim 19 , wherein the initial timeout window is extended based on information included in the extension request.

26. The article of manufacture of claim 19 , wherein the instructions are further configured to cause the at least one computer processor to operate so as to transmit, to the external pairing system, during the extended timeout window, updated information identifying the one or more tasks and the one or more agents, the updated information identifying a greater number of tasks, a greater number of agents, or a greater number of tasks and a greater number of agents than the first information.

27. The article of manufacture of claim 19 , wherein the instructions are further configured to cause the at least one computer processor to operate so as to route a task among the one or more tasks to an agent among the one or more agents in accordance with the selected pairing.

28. A method for pairing in an external pairing system communicatively coupled to a task assignment system, the method comprising:

receiving, by at least one computer processor communicatively coupled to and configured to operate in the external pairing system, from the task assignment system over an application programming interface, information that identifies one or more tasks waiting for assignment in a switch of the task assignment system and one or more agents available for assignment in the switch of the task assignment system, wherein the external pairing system is configured to execute at least one pairing strategy based at least in part on at least one artificial intelligence model that increases overall performance of the task assignment system relative to an internal pairing system of the task assignment system, wherein the application programming interface at least partially isolates the external pairing system from other portions of the task assignment system and controls information exchanged between the external pairing system and the other portions of the task assignment system;

receiving, by the at least one computer processor, from the task assignment system, a pairing request that is associated with an initial timeout window;

determining, by the at least one computer processor, to postpone selecting a pairing between the one or more tasks and the one or more agents;

transmitting, by the at least one computer processor, to the task assignment system, at a first time within the initial timeout window, an extension request that includes an instruction to extend the initial timeout window;

selecting, by the at least one computer processor, the pairing between the one or more tasks and the one or more agents by executing the at least one pairing strategy;

transmitting, by the at least one computer processor, to the task assignment system, at a second time within the extended timeout window, a pairing response that identifies the selected pairing; and

causing, by the at least one computer processor, the one or more tasks to be routed to the one or more agents in the switch of the task assignment system based at least in part upon the selected pairing;

wherein the external pairing system has access to less information associated with the switch of the task assignment system and less control over operations of the switch relative to the internal pairing system of the task assignment system.

29. The method of claim 28 , wherein the task assignment system is a contact center system.

30. The method of claim 28 , wherein the selected pairing is selected according to a behavioral pairing strategy.

31. The method of claim 28 , wherein the initial timeout window is extended by a predetermined duration of time.

32. The method of claim 28 , wherein the initial timeout window is extended until a number of pairing choices exceeds a predetermined threshold.

33. The method of claim 28 , wherein the initial timeout window is extended until the task assignment system transitions to an L3 environment.

34. The method of claim 28 , wherein the initial timeout window is extended based on information included in the extension request.

35. The method of claim 28 , further comprising receiving, by the at least one computer processor, from the task assignment system, during the extended timeout window, updated information identifying the one or more tasks and the one or more agents, the updated information identifying a greater number of tasks, a greater number of agents, or a greater number of tasks and a greater number of agents than the first information.

36. The method of claim 28 , further comprising routing a task among the one or more tasks to an agent among the one or more agents in accordance with the selected pairing.

37. A system for pairing in an external pairing system communicatively coupled to a task assignment system comprising:

at least one computer processor communicatively coupled to and configured to operate in the external pairing system, wherein the at least one computer processor is further configured to:

receive, from the task assignment system over an application programming interface, information that identifies one or more tasks waiting for assignment in a switch of the task assignment system and one or more agents available for assignment in the switch of the task assignment system, wherein the external pairing system is configured to execute at least one pairing strategy based at least in part on at least one artificial intelligence model that increases overall performance of the task assignment system relative to an internal pairing system of the task assignment system, wherein the application programming interface at least partially isolates the external pairing system from other portions of the task assignment system and controls information exchanged between the external pairing system and the other portions of the task assignment system;

receive, from the task assignment system, a pairing request that is associated with an initial timeout window;

determine to postpone selecting a pairing between the one or more tasks and the one or more agents;

transmit, to the task assignment system, at a first time within the initial timeout window, an extension request that includes an instruction to extend the initial timeout window;

select the pairing between the one or more tasks and the one or more agents by executing the at least one pairing strategy;

transmit, to the task assignment system, at a second time within the extended timeout window, a pairing response that identifies the selected pairing; and

cause the one or more tasks to be routed to the one or more agents in the switch of the task assignment system based at least in part upon the selected pairing;

wherein the external pairing system has access to less information associated with the switch of the task assignment system and less control over operations of the switch relative to the internal pairing system of the task assignment system.

38. The system of claim 37 , wherein the task assignment system is a contact center system.

39. The system of claim 37 , wherein the selected pairing is selected according to a behavioral pairing strategy.

40. The system of claim 37 , wherein the initial timeout window is extended by a predetermined duration of time.

41. The system of claim 37 , wherein the initial timeout window is extended until a number of pairing choices exceeds a predetermined threshold.

42. The system of claim 37 , wherein the initial timeout window is extended until the task assignment system transitions to an L3 environment.

43. The system of claim 37 , wherein the initial timeout window is extended based on information included in the extension request.

44. The system of claim 37 , wherein the at least one computer processor is further configured to receive, from the task assignment system, during the extended timeout window, updated information identifying the one or more tasks and the one or more agents, the updated information identifying a greater number of tasks, a greater number of agents, or a greater number of tasks and a greater number of agents than the first information.

45. The system of claim 37 , wherein the at least one computer processor is further configured to route a task among the one or more tasks to an agent among the one or more agents in accordance with the selected pairing.

46. An article of manufacture for pairing in an external pairing system communicatively coupled to 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 operate in the external pairing system and thereby cause the at least one computer processor to operate so as to:

receive, from the task assignment system over an application programming interface, information that identifies one or more tasks waiting for assignment in a switch of the task assignment system and one or more agents available for assignment in the switch of the task assignment system, wherein the external pairing system is configured to execute at least one pairing strategy based at least in part on at least one artificial intelligence model that increases overall performance of the task assignment system relative to an internal pairing system of the task assignment system, wherein the application programming interface at least partially isolates the external pairing system from other portions of the task assignment system and controls information exchanged between the external pairing system and the other portions of the task assignment system;

receive, from the task assignment system, a pairing request that is associated with an initial timeout window;

determine to postpone selecting a pairing between the one or more tasks and the one or more agents;

transmit, to the task assignment system, at a first time within the initial timeout window, an extension request that includes an instruction to extend the initial timeout window;

select the pairing between the one or more tasks and the one or more agents by executing the at least one pairing strategy;

transmit, to the task assignment system, at a second time within the extended timeout window, a pairing response that identifies the selected pairing; and

cause the one or more tasks to be routed to the one or more agents in the switch of the task assignment system based at least in part upon the selected pairing;

wherein the external pairing system has access to less information associated with the switch of the task assignment system and less control over operations of the switch relative to the internal pairing system of the task assignment system.

47. The article of manufacture of claim 46 , wherein the task assignment system is a contact center system.

48. The article of manufacture of claim 46 , wherein the selected pairing is selected according to a behavioral pairing strategy.

49. The article of manufacture of claim 46 , wherein the initial timeout window is extended by a predetermined duration of time.

50. The article of manufacture of claim 46 , wherein the initial timeout window is extended until a number of pairing choices exceeds a predetermined threshold.

51. The article of manufacture of claim 46 , wherein the initial timeout window is extended until the task assignment system transitions to an L3 environment.

52. The article of manufacture of claim 46 , wherein the initial timeout window is extended based on information included in the extension request.

53. The article of manufacture of claim 46 , wherein the instructions are further configured to cause the at least one computer processor to operate so as to receive, from the task assignment system, during the extended timeout window, updated information identifying the one or more tasks and the one or more agents, the updated information identifying a greater number of tasks, a greater number of agents, or a greater number of tasks and a greater number of agents than the first information.

54. The article of manufacture of claim 46 , wherein the instructions are further configured to cause the at least one computer processor to operate so as to route a task among the one or more tasks to an agent among the one or more agents in accordance with the selected pairing.

Assignments (6)
RELEASE AND TERMINATION OF PATENT SECURITY AGREEMENT Recorded Apr 16, 2025
From: VCP CAPITAL MARKETS, LLC
To: AFINITI, LTD.
Reel/Frame 070866/0614 →
PATENT ASSIGNMENT AGREEMENT Recorded Jan 3, 2025
From: AFINITI AI HOLDINGS LLC
To: AFINITI AI LIMITED
Reel/Frame 069817/0001 →
PATENT ASSIGNMENT AGREEMENT Recorded Jan 3, 2025
From: AFINITI, LTD.
To: AFINITI AI HOLDINGS LLC
Reel/Frame 069816/0656 →
PATENT SECURITY AGREEMENT Recorded Jan 3, 2025
From: AFINITI AI LIMITED
To: ALTER DOMUS (US) LLC
Reel/Frame 069816/0858 →
PATENT SECURITY AGREEMENT Recorded Aug 26, 2024
From: AFINITI, LTD.
To: VCP CAPITAL MARKETS, LLC
Reel/Frame 068793/0261 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 5, 2021
From: CHISHTY, AIN
To: AFINITI, LTD.
Reel/Frame 055162/0924 →
Continuity (2)
Provisional Application 62970529 · Feb 5, 2020
Related Publication 20210240531A1 · Aug 5, 2021
References Cited (397)
US 5155763A · Bigus et al. · 1992 [cited by applicant]
US 5206903A · Kohler et al. · 1993 [cited by applicant]
US 5327490A · Cave · 1994 [cited by applicant]
US 5537470A · Lee · 1996 [cited by applicant]
US 5702253A · Bryce et al. · 1997 [cited by applicant]
US 5825869A · Brooks et al. · 1998 [cited by applicant]
US 5903641A · Tonisson · 1999 [cited by applicant]
US 5907601A · David et al. · 1999 [cited by applicant]
US 5926538A · Deryugin et al. · 1999 [cited by applicant]
US 6021428A · Miloslavsky · 2000 [cited by applicant]
US 6044355A · Crockett et al. · 2000 [cited by applicant]
US 6044468A · Osmond · 2000 [cited by applicant]
US 6049603A · Schwartz et al. · 2000 [cited by applicant]
US 6052460A · Fisher et al. · 2000 [cited by applicant]
US 6064731A · Flockhart et al. · 2000 [cited by applicant]
US 6088444A · Walker et al. · 2000 [cited by applicant]
US 6163607A · Bogart et al. · 2000 [cited by applicant]
US 6222919B1 · Hollatz et al. · 2001 [cited by applicant]
US 6292555B1 · Okamoto · 2001 [cited by applicant]
US 6324282B1 · McIllwaine et al. · 2001 [cited by applicant]
US 6333979B1 · Bondi et al. · 2001 [cited by applicant]
US 6389132B1 · Price · 2002 [cited by applicant]
US 6389400B1 · Bushey et al. · 2002 [cited by applicant]
US 6408066B1 · Andruska et al. · 2002 [cited by applicant]
US 6411687B1 · Bohacek et al. · 2002 [cited by applicant]
US 6424709B1 · Doyle et al. · 2002 [cited by applicant]
US 6434230B1 · Gabriel · 2002 [cited by applicant]
US 6496580B1 · Chack · 2002 [cited by applicant]
US 6504920B1 · Okon et al. · 2003 [cited by applicant]
US 6519335B1 · Bushnell · 2003 [cited by applicant]
US 6519568B1 · Harvey et al. · 2003 [cited by applicant]
US 6535600B1 · Fisher et al. · 2003 [cited by applicant]
US 6535601B1 · Flockhart et al. · 2003 [cited by applicant]
US 6570980B1 · Baruch · 2003 [cited by applicant]
US 6587556B1 · Judkins et al. · 2003 [cited by applicant]
US 6603854B1 · Judkins et al. · 2003 [cited by applicant]
US 6639976B1 · Shellum et al. · 2003 [cited by applicant]
US 6661889B1 · Flockhart et al. · 2003 [cited by applicant]
US 6704410B1 · McFarlane et al. · 2004 [cited by applicant]
US 6707904B1 · Judkins et al. · 2004 [cited by applicant]
US 6714643B1 · Gargeya et al. · 2004 [cited by applicant]
US 6744878B1 · Komissarchik et al. · 2004 [cited by applicant]
US 6763104B1 · Judkins et al. · 2004 [cited by applicant]
US 6774932B1 · Ewing et al. · 2004 [cited by applicant]
US 6775378B1 · Villena et al. · 2004 [cited by applicant]
US 6798876B1 · Bala · 2004 [cited by applicant]
US 6829348B1 · Schroeder et al. · 2004 [cited by applicant]
US 6832203B1 · Villena et al. · 2004 [cited by applicant]
US 6859529B2 · Duncan et al. · 2005 [cited by applicant]
US 6895083B1 · Bers et al. · 2005 [cited by applicant]
US 6922466B1 · Peterson et al. · 2005 [cited by applicant]
US 6937715B2 · Delaney · 2005 [cited by applicant]
US 6956941B1 · Duncan et al. · 2005 [cited by applicant]
US 6970821B1 · Shambaugh et al. · 2005 [cited by applicant]
US 6978006B1 · Polcyn · 2005 [cited by applicant]
US 7023979B1 · Wu et al. · 2006 [cited by applicant]
US 7039166B1 · Peterson et al. · 2006 [cited by applicant]
US 7050566B2 · Becerra et al. · 2006 [cited by applicant]
US 7050567B1 · Jensen · 2006 [cited by applicant]
US 7062031B2 · Becerra et al. · 2006 [cited by applicant]
US 7068775B1 · Lee · 2006 [cited by applicant]
US 7092509B1 · Mears et al. · 2006 [cited by applicant]
US 7103172B2 · Brown et al. · 2006 [cited by applicant]
US 7158628B2 · McConnell et al. · 2007 [cited by applicant]
US 7184540B2 · Dezonno et al. · 2007 [cited by applicant]
US 7209549B2 · Reynolds et al. · 2007 [cited by applicant]
US 7231032B2 · Nevman et al. · 2007 [cited by applicant]
US 7231034B1 · Rikhy et al. · 2007 [cited by applicant]
US 7236584B2 · Torba · 2007 [cited by applicant]
US 7245716B2 · Brown et al. · 2007 [cited by applicant]
US 7245719B2 · Kawada et al. · 2007 [cited by applicant]
US 7266251B2 · Rowe · 2007 [cited by applicant]
US 7269253B1 · Wu et al. · 2007 [cited by applicant]
US 7353388B1 · Gilman et al. · 2008 [cited by applicant]
US 7372952B1 · Wu et al. · 2008 [cited by applicant]
US 7398224B2 · Cooper · 2008 [cited by applicant]
US 7593521B2 · Becerra et al. · 2009 [cited by applicant]
US 7676034B1 · Wu et al. · 2010 [cited by applicant]
US 7725339B1 · Aykin · 2010 [cited by applicant]
US 7734032B1 · Kiefhaber et al. · 2010 [cited by applicant]
US 7798876B2 · Mix · 2010 [cited by applicant]
US 7826597B2 · Berner et al. · 2010 [cited by applicant]
US 7864944B2 · Khouri et al. · 2011 [cited by applicant]
US 7899177B1 · Bruening et al. · 2011 [cited by applicant]
US 7916858B1 · Heller et al. · 2011 [cited by applicant]
US 7940917B2 · Lauridsen et al. · 2011 [cited by applicant]
US 7961866B1 · Boutcher et al. · 2011 [cited by applicant]
US 7995717B2 · Conway et al. · 2011 [cited by applicant]
US 8000989B1 · Kiefhaber et al. · 2011 [cited by applicant]
US 8010607B2 · McCormack et al. · 2011 [cited by applicant]
US 8094790B2 · Conway et al. · 2012 [cited by applicant]
US 8126133B1 · Everingham et al. · 2012 [cited by applicant]
US 8140441B2 · Cases et al. · 2012 [cited by applicant]
US 8175253B2 · Knott et al. · 2012 [cited by applicant]
US 8229102B2 · Knott et al. · 2012 [cited by applicant]
US 8249245B2 · Jay et al. · 2012 [cited by applicant]
US 8295471B2 · Spottiswoode et al. · 2012 [cited by applicant]
US 8300798B1 · Wu et al. · 2012 [cited by applicant]
US 8306212B2 · Arora · 2012 [cited by applicant]
US 8359219B2 · Chishti et al. · 2013 [cited by applicant]
US 8433597B2 · Chishti et al. · 2013 [cited by applicant]
US 8472611B2 · Chishti · 2013 [cited by applicant]
US 8565410B2 · Chishti et al. · 2013 [cited by applicant]
US 8634542B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8644490B2 · Stewart · 2014 [cited by applicant]
US 8670548B2 · Xie et al. · 2014 [cited by applicant]
US 8699694B2 · Chishti et al. · 2014 [cited by applicant]
US 8712821B2 · Spottiswoode · 2014 [cited by applicant]
US 8718271B2 · Spottiswoode · 2014 [cited by applicant]
US 8724797B2 · Chishti et al. · 2014 [cited by applicant]
US 8731178B2 · Chishti et al. · 2014 [cited by applicant]
US 8737595B2 · Chishti et al. · 2014 [cited by applicant]
US 8750488B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8761380B2 · Kohler et al. · 2014 [cited by applicant]
US 8781100B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8781106B2 · Afzal · 2014 [cited by applicant]
US 8792630B2 · Chishti et al. · 2014 [cited by applicant]
US 8824658B2 · Chishti · 2014 [cited by applicant]
US 8831207B1 · Agarwal · 2014 [cited by applicant]
US 8856869B1 · Brinskelle · 2014 [cited by applicant]
US 8879715B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8903079B2 · Xie et al. · 2014 [cited by applicant]
US 8913736B2 · Kohler et al. · 2014 [cited by applicant]
US 8929537B2 · Chishti et al. · 2015 [cited by applicant]
US 8938063B1 · Hackbarth et al. · 2015 [cited by applicant]
US 8995647B2 · Li et al. · 2015 [cited by applicant]
US 9020137B2 · Chishti et al. · 2015 [cited by applicant]
US 9025757B2 · Spottiswoode et al. · 2015 [cited by applicant]
US 9042265B1 · Vendrow et al. · 2015 [cited by applicant]
US 9215323B2 · Chishti · 2015 [cited by applicant]
US 9277055B2 · Spottiswoode et al. · 2016 [cited by applicant]
US 9300802B1 · Chishti · 2016 [cited by applicant]
US 9426296B2 · Chishti et al. · 2016 [cited by applicant]
US 9712676B1 · Chishti · 2017 [cited by applicant]
US 9712679B2 · Chishti et al. · 2017 [cited by applicant]
US 9781269B2 · Chishti et al. · 2017 [cited by applicant]
US 9787841B2 · Chishti et al. · 2017 [cited by applicant]
US 9930180B1 · Kan et al. · 2018 [cited by applicant]
US 9942405B1 · Kan et al. · 2018 [cited by applicant]
US RE46986E · Chishti et al. · 2018 [cited by applicant]
US 10116800B1 · Kan et al. · 2018 [cited by applicant]
US 10135987B1 · Chishti et al. · 2018 [cited by applicant]
US RE47201E · Chishti et al. · 2019 [cited by applicant]
US 10284727B2 · Kan et al. · 2019 [cited by applicant]
US 10404861B2 · Kan et al. · 2019 [cited by applicant]
US 10956855B1 · Coughran · 2021 [cited by examiner]
US 20010032120A1 · Stuart et al. · 2001 [cited by applicant]
US 20010044896A1 · Schwartz et al. · 2001 [cited by applicant]
US 20020018554A1 · Jensen et al. · 2002 [cited by applicant]
US 20020046030A1 · Haritsa et al. · 2002 [cited by applicant]
US 20020059164A1 · Shtivelman · 2002 [cited by applicant]
US 20020082736A1 · Lech et al. · 2002 [cited by applicant]
US 20020110234A1 · Walker et al. · 2002 [cited by applicant]
US 20020111172A1 · DeWolf et al. · 2002 [cited by applicant]
US 20020131399A1 · Philonenko · 2002 [cited by applicant]
US 20020138285A1 · DeCotiis et al. · 2002 [cited by applicant]
US 20020143599A1 · Nourbakhsh et al. · 2002 [cited by applicant]
US 20020161765A1 · Kundrot et al. · 2002 [cited by applicant]
US 20020184069A1 · Kosiba et al. · 2002 [cited by applicant]
US 20020196845A1 · Richards et al. · 2002 [cited by applicant]
US 20030002653A1 · Uckun · 2003 [cited by applicant]
US 20030059029A1 · Mengshoel et al. · 2003 [cited by applicant]
US 20030081757A1 · Mengshoel et al. · 2003 [cited by applicant]
US 20030095652A1 · Mengshoel et al. · 2003 [cited by applicant]
US 20030169870A1 · Stanford · 2003 [cited by applicant]
US 20030174830A1 · Boyer et al. · 2003 [cited by applicant]
US 20030217016A1 · Pericle · 2003 [cited by applicant]
US 20040028211A1 · Culp et al. · 2004 [cited by applicant]
US 20040057416A1 · McCormack · 2004 [cited by applicant]
US 20040096050A1 · Das et al. · 2004 [cited by applicant]
US 20040098274A1 · Dezonno et al. · 2004 [cited by applicant]
US 20040101127A1 · Dezonno et al. · 2004 [cited by applicant]
US 20040109555A1 · Williams · 2004 [cited by applicant]
US 20040133434A1 · Szlam et al. · 2004 [cited by applicant]
US 20040210475A1 · Starnes et al. · 2004 [cited by applicant]
US 20040230438A1 · Pasquale et al. · 2004 [cited by applicant]
US 20040267816A1 · Russek · 2004 [cited by applicant]
US 20050013428A1 · Walters · 2005 [cited by applicant]
US 20050043986A1 · McConnell et al. · 2005 [cited by applicant]
US 20050047581A1 · Shaffer et al. · 2005 [cited by applicant]
US 20050047582A1 · Shaffer et al. · 2005 [cited by applicant]
US 20050071223A1 · Jain et al. · 2005 [cited by applicant]
US 20050129212A1 · Parker · 2005 [cited by applicant]
US 20050135593A1 · Becerra et al. · 2005 [cited by applicant]
US 20050135596A1 · Zhao · 2005 [cited by applicant]
US 20050187802A1 · Koeppel · 2005 [cited by applicant]
US 20050195960A1 · Shaffer et al. · 2005 [cited by applicant]
US 20050286709A1 · Horton et al. · 2005 [cited by applicant]
US 20060098803A1 · Bushey et al. · 2006 [cited by applicant]
US 20060110052A1 · Finlayson · 2006 [cited by applicant]
US 20060124113A1 · Roberts · 2006 [cited by applicant]
US 20060184040A1 · Keller et al. · 2006 [cited by applicant]
US 20060222164A1 · Contractor et al. · 2006 [cited by applicant]
US 20060233346A1 · McIlwaine et al. · 2006 [cited by applicant]
US 20060262918A1 · Karnalkar et al. · 2006 [cited by applicant]
US 20060262922A1 · Margulies et al. · 2006 [cited by applicant]
US 20070036323A1 · Travis · 2007 [cited by applicant]
US 20070071222A1 · Flockhart et al. · 2007 [cited by applicant]
US 20070116240A1 · Foley et al. · 2007 [cited by applicant]
US 20070121602A1 · Sin et al. · 2007 [cited by applicant]
US 20070121829A1 · Tal et al. · 2007 [cited by applicant]
US 20070136342A1 · Singhai et al. · 2007 [cited by applicant]
US 20070153996A1 · Hansen · 2007 [cited by applicant]
US 20070154007A1 · Bernhard · 2007 [cited by applicant]
US 20070174111A1 · Anderson et al. · 2007 [cited by applicant]
US 20070198322A1 · Bourne et al. · 2007 [cited by applicant]
US 20070211881A1 · Parker-Stephen · 2007 [cited by applicant]
US 20070219816A1 · Van Luchene et al. · 2007 [cited by applicant]
US 20070274502A1 · Brown · 2007 [cited by applicant]
US 20080002823A1 · Fama et al. · 2008 [cited by applicant]
US 20080008309A1 · Dezonno et al. · 2008 [cited by applicant]
US 20080046386A1 · Pieraccinii et al. · 2008 [cited by applicant]
US 20080065476A1 · Klein et al. · 2008 [cited by applicant]
US 20080118052A1 · Houmaidi et al. · 2008 [cited by applicant]
US 20080144803A1 · Jaiswal et al. · 2008 [cited by applicant]
US 20080152122A1 · Idan et al. · 2008 [cited by applicant]
US 20080181389A1 · Bourne et al. · 2008 [cited by applicant]
US 20080199000A1 · Su et al. · 2008 [cited by applicant]
US 20080205611A1 · Jordan et al. · 2008 [cited by applicant]
US 20080267386A1 · Cooper · 2008 [cited by applicant]
US 20080273687A1 · Knott et al. · 2008 [cited by applicant]
US 20090043670A1 · Johansson et al. · 2009 [cited by applicant]
US 20090086933A1 · Patel et al. · 2009 [cited by applicant]
US 20090190740A1 · Chishti et al. · 2009 [cited by applicant]
US 20090190743A1 · Spottiswoode · 2009 [cited by applicant]
US 20090190744A1 · Xie et al. · 2009 [cited by applicant]
US 20090190745A1 · Xie et al. · 2009 [cited by applicant]
US 20090190746A1 · Chishti et al. · 2009 [cited by applicant]
US 20090190747A1 · Spottiswoode · 2009 [cited by applicant]
US 20090190748A1 · Chishti et al. · 2009 [cited by applicant]
US 20090190749A1 · Xie et al. · 2009 [cited by applicant]
US 20090190750A1 · Xie et al. · 2009 [cited by applicant]
US 20090232294A1 · Xie et al. · 2009 [cited by applicant]
US 20090234710A1 · Belgaied Hassine et al. · 2009 [cited by applicant]
US 20090245493A1 · Chen et al. · 2009 [cited by applicant]
US 20090249083A1 · Forlenza et al. · 2009 [cited by applicant]
US 20090304172A1 · Becerra et al. · 2009 [cited by applicant]
US 20090305172A1 · Tanaka et al. · 2009 [cited by applicant]
US 20090318111A1 · Desai et al. · 2009 [cited by applicant]
US 20090323921A1 · Spottiswoode et al. · 2009 [cited by applicant]
US 20100020959A1 · Spottiswoode · 2010 [cited by applicant]
US 20100020961A1 · Spottiswoode · 2010 [cited by applicant]
US 20100054431A1 · Jaiswal et al. · 2010 [cited by applicant]
US 20100054452A1 · Afzal · 2010 [cited by applicant]
US 20100054453A1 · Stewart · 2010 [cited by applicant]
US 20100086120A1 · Brussat et al. · 2010 [cited by applicant]
US 20100111285A1 · Chishti · 2010 [cited by applicant]
US 20100111286A1 · Chishti · 2010 [cited by applicant]
US 20100111287A1 · Xie et al. · 2010 [cited by applicant]
US 20100111288A1 · Afzal et al. · 2010 [cited by applicant]
US 20100142689A1 · Hansen et al. · 2010 [cited by applicant]
US 20100142698A1 · Spottiswoode et al. · 2010 [cited by applicant]
US 20100158238A1 · Saushkin · 2010 [cited by applicant]
US 20100183138A1 · Spottiswoode et al. · 2010 [cited by applicant]
US 20110022357A1 · Vock et al. · 2011 [cited by applicant]
US 20110031112A1 · Birang et al. · 2011 [cited by applicant]
US 20110069821A1 · Korolev et al. · 2011 [cited by applicant]
US 20110125048A1 · Causevic et al. · 2011 [cited by applicant]
US 20110206199A1 · Arora · 2011 [cited by applicant]
US 20120051536A1 · Chishti et al. · 2012 [cited by applicant]
US 20120051537A1 · Chishti et al. · 2012 [cited by applicant]
US 20120183131A1 · Kohler et al. · 2012 [cited by applicant]
US 20120224680A1 · Spottiswoode et al. · 2012 [cited by applicant]
US 20120269053A1 · Yu · 2012 [cited by examiner]
US 20120278136A1 · Flockhart et al. · 2012 [cited by applicant]
US 20130003959A1 · Nishikawa et al. · 2013 [cited by applicant]
US 20130051545A1 · Ross et al. · 2013 [cited by applicant]
US 20130251137A1 · Chishti et al. · 2013 [cited by applicant]
US 20130287202A1 · Flockhart et al. · 2013 [cited by applicant]
US 20140044246A1 · Klemm et al. · 2014 [cited by applicant]
US 20140079210A1 · Kohler et al. · 2014 [cited by applicant]
US 20140119531A1 · Tuchman et al. · 2014 [cited by applicant]
US 20140119533A1 · Spottiswoode et al. · 2014 [cited by applicant]
US 20140270133A1 · Conway et al. · 2014 [cited by applicant]
US 20140341370A1 · Li et al. · 2014 [cited by applicant]
US 20150055772A1 · Klemm et al. · 2015 [cited by applicant]
US 20150281448A1 · Putra et al. · 2015 [cited by applicant]
US 20160080573A1 · Chishti · 2016 [cited by applicant]
US 20170013131A1 · Craib · 2017 [cited by applicant]
US 20170064080A1 · Chishti et al. · 2017 [cited by applicant]
US 20170064081A1 · Chishti et al. · 2017 [cited by applicant]
US 20170316438A1 · Konig et al. · 2017 [cited by applicant]
US 20180191904A1 · Chishti · 2018 [cited by examiner]
US 20180316793A1 · Kan et al. · 2018 [cited by applicant]
US 20180316794A1 · Kan et al. · 2018 [cited by applicant]
US 20190149619A1 · Lisac · 2019 [cited by examiner]
US 20190222697A1 · Kan et al. · 2019 [cited by applicant]
AU 2008349500C1 · 2014 [cited by applicant]
AU 2009209317B2 · 2014 [cited by applicant]
AU 2009311534B2 · 2014 [cited by applicant]
AU 2015203175A1 · 2015 [cited by applicant]
AU 2015243001A1 · 2015 [cited by applicant]
CN 101093590A · 2007 [cited by applicant]
CN 102164073A · 2011 [cited by applicant]
CN 102390184A · 2012 [cited by applicant]
CN 102555536A · 2012 [cited by applicant]
CN 202965525U · 2013 [cited by applicant]
CN 203311505U · 2013 [cited by applicant]
CN 102301688B · 2014 [cited by applicant]
CN 102017591B · 2014 [cited by applicant]
CN 108197912A · 2018 [cited by applicant]
CN 110177181A · 2019 [cited by applicant]
CN 110740217A · 2020 [cited by applicant]
EP 0493292A2 · 1992 [cited by applicant]
EP 0863651A2 · 1998 [cited by applicant]
EP 0949793A1 · 1999 [cited by applicant]
EP 1011974A1 · 2000 [cited by applicant]
EP 1032188A1 · 2000 [cited by applicant]
EP 1107557A2 · 2001 [cited by applicant]
EP 1335572A2 · 2003 [cited by applicant]
EP 2338270B1 · 2018 [cited by applicant]
GB 2339643A · 2000 [cited by applicant]
JP 11098252A · 1999 [cited by applicant]
JP 2000069168A · 2000 [cited by applicant]
JP 2000078291A · 2000 [cited by applicant]
JP 2000078292A · 2000 [cited by applicant]
JP 2000092213A · 2000 [cited by applicant]
JP 2000507420A · 2000 [cited by applicant]
JP 2000236393A · 2000 [cited by applicant]
JP 2000253154A · 2000 [cited by applicant]
JP 2001292236A · 2001 [cited by applicant]
JP 2001518753A · 2001 [cited by applicant]
JP 2002297900A · 2002 [cited by applicant]
JP 3366565B2 · 2003 [cited by applicant]
JP 2003187061A · 2003 [cited by applicant]
JP 2004056517A · 2004 [cited by applicant]
JP 2004227228A · 2004 [cited by applicant]
JP 2006345132A · 2006 [cited by applicant]
JP 2007324708A · 2007 [cited by applicant]
JP 2009081627A · 2009 [cited by applicant]
JP 2011511533A · 2011 [cited by applicant]
JP 2011511536A · 2011 [cited by applicant]
JP 2012075146A · 2012 [cited by applicant]
JP 5421928B2 · 2014 [cited by applicant]
JP 5631326B2 · 2014 [cited by applicant]
JP 5649575B2 · 2015 [cited by applicant]
JP 2015514268A · 2015 [cited by applicant]
JP 2015514371A · 2015 [cited by applicant]
KR 1020020044077A · 2002 [cited by applicant]
KR 1020130099554A · 2013 [cited by applicant]
MX 316118 · 2013 [cited by applicant]
MX 322251 · 2014 [cited by applicant]
NZ 587100B · 2013 [cited by applicant]
NZ 587101B · 2013 [cited by applicant]
NZ 591486B · 2014 [cited by applicant]
NZ 592781B · 2014 [cited by applicant]
PH 12010501704 · 2014 [cited by applicant]
PH 12010501705 · 2015 [cited by applicant]
PH 12011500868 · 2015 [cited by applicant]
WO WO199917517A1 · 1999 [cited by applicant]
WO WO0070849A2 · 2000 [cited by applicant]
WO WO2001063894A2 · 2001 [cited by applicant]
WO WO2006124113A2 · 2006 [cited by applicant]
WO WO2009097018A1 · 2009 [cited by applicant]
WO WO2009097210A1 · 2009 [cited by applicant]
WO WO2010053701A2 · 2010 [cited by applicant]
WO WO2011081514A1 · 2011 [cited by applicant]
WO WO2013148453A1 · 2013 [cited by applicant]
WO WO2015019806A1 · 2015 [cited by applicant]
WO WO2016048290A1 · 2016 [cited by applicant]
Afiniti, “Afiniti® Enterprise Behavioral Pairing™ Improves Contact Center Performance,” White Paper, retrieved online from URL: <http://www.afinitit,com/wp-content/uploads/2016/04/Afiniti_White-Paper_Web-Email.pdf> 2016… [cited by applicant]
Anonymous, (2006) “Performance Based Routing in Profit Call Centers,” The Decision Makers' Direct, located at www.decisioncraft.com, Issue Jun. 2002, (3 pages). [cited by applicant]
Chen, G., et al., “Enhanced Locality Sensitive Clustering in High Dimensional Space”, Transactions on Electrical and Electronic Materials, vol. 15, No. 3, Jun. 25, 2014, pp. 125-129 (5 pages). [cited by applicant]
Cleveland, William S., “Robust Locally Weighted Regression and Smoothing Scatterplots,” Journal of the American Statistical Association, vol. 74, No. 368, pp. 829-836 (Dec. 1979). [cited by applicant]
Cormen, T.H., et al., “ Introduction to Algorithms”, Third Edition, Chapter 26 and 29, 2009, (116 pages). [cited by applicant]
Gans, N. et al., “Telephone Call Centers: Tutorial, Review and Research Prospects,” Manufacturing & Service Operations Management, vol. 5, No. 2, 2003, pp. 79-141, (84 pages). [cited by applicant]
International Preliminary Report on Patentability and Written Opinion issued in connection with PCT/US2009/066254 dated Jun. 14, 2011, (6 pages). [cited by applicant]
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for PCT/IB2016/001762 dated Feb. 20, 2017, (15 pages). [cited by applicant]
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for PCT/IB2016/001776 dated Mar. 3, 2017, (16 pages). [cited by applicant]
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for PCT/IB2017/000570 dated Jun. 30, 2017, (13 pages). [cited by applicant]
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for PCT/IB2018/000434 dated Jun. 20, 2018, (14 pages). [cited by applicant]
International Search Report and Written Opinion issued in connection with PCT/IB2018/000886 dated Dec. 4, 2018, (13 pages). [cited by applicant]
International Search Report and Written Opinion issued in connection with PCT/IB2018/000907 dated Nov. 26, 2018, (11 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2009/054352 dated Mar. 12, 2010, (5 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2008/077042 dated Mar. 13, 2009, (3 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2009/031611 dated Jun. 3, 2009, (5 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2009/061537 dated Jun. 7, 2010, (5 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2009/066254 dated Feb. 24, 2010, (4 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2013/033261 dated Jun. 14, 2013, (3 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2013/033265 dated Jul. 9, 2013, (2 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2013/033268 dated May 31, 2013, (2 pages). [cited by applicant]
Ioannis Ntzoufras “Bayesian Modeling Using Winbugs An Introduction”, Department of Statistics, Athens University of Economics and Business, Wiley-Interscience, A John Wiley & Sons, Inc., Publication, Chapter 5, Jan. 1, … [cited by applicant]
Koole, G. et al., “An Overview of Routing and Staffing Algorithms in Multi-Skill Customer Contact Centers,” Manuscript, Mar. 6, 2006, (42 pages). [cited by applicant]
Koole, G., “Performance Analysis and Optimization in Customer Contact Centers,” Proceedings of the Quantitative Evaluation of Systems, First International Conference, Sep. 27-30, 2004, (4 pages). [cited by applicant]
Nocedal, J. and Wright, S. J., “Numerical Optimization,” Chapter 16 Quadratic Programming, 2006, pp. 448-496 (50 pages). [cited by applicant]
Ntzoufras, “Bayesian Modeling Using Winbugs”. Wiley Interscience, Chapter 5, Normal Regression Models, Oct. 18, 2007, Redacted version, pp. 155-220 (67 pages). [cited by applicant]
Press, W. H. and Rybicki, G. B., “Fast Algorithm for Spectral Analysis of Unevenly Sampled Data,” The Astrophysical Journal, vol. 338, Mar. 1, 1989, pp. 277-280 (4 pages). [cited by applicant]
Riedmiller, M. et al., “A Direct Adaptive Method for Faster Backpropagation Learning: The RPROP Algorithm,” 1993 IEEE International Conference on Neural Networks, San Francisco, CA, Mar. 28-Apr. 1, 1993, 1:586-591 (8 pa… [cited by applicant]
Stanley et al., “Improving Call Center Operations Using Performance-Based Routing Strategies,” California Journal of Operations Management, 6(1), 24-32, Feb. 2008; retrieved from http://userwww.sfsu.edu/saltzman/Publist… [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2009/054352 dated Mar. 12, 2010, (5 pages). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2008/077042 dated Mar. 13, 2009, (6 pages). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2009/031611 dated Jun. 3, 2009, (7 pages). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2009/061537 dated Jun. 7, 2010, (10 pages). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2009/066254 dated Feb. 24, 2010, (5 pages). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2013/033261 dated Jun. 14, 2013, (7 pages). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2013/033265 dated Jul. 9, 2013, (7 pages). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2013/033268 dated May 31, 2013, (7 pages). [cited by applicant]