Patent Application
20210365850
The invention relates to resources and co-resources and more particularly to methods of matching resources with co-resources.
Methods of matching information resources with information consumers are generally known. On a first level, a private party may have a question and look for a source of information to provide an answer to the question. The party may call an organization associated with the question or access a search engine (e.g., Google) through the Internet and enter the question. The search engine may search for information resources that may be capable of providing answers and return a list of contacts that may be able to answer the question. Typically, the contacts are identifiers of organizations that may be able to answer the question.
The party may call an organization identified by the search, an agent of the organization may answer the call and the agent may attempt to answer any questions arising from the call. If the agent cannot answer the question, then the agent will either place the client on hold to call someone else or get the client's number and promise to call him/her back when he/she has an answer.
On the same or another level, a member of an organization, in general, may have a question about operation of the organization. In this case, the member may simply begin to call other members of the organization. In some cases, the organization may have a telephone directory that is divided into departments. By knowing the general subject matter of a question, the member may simply begin to call members of a particular department until the calling member finds a suitable answer.
In any case, the process is haphazard and may have many dead ends. If members of a department do not have an answer to the question, the agent or member may call other departments or members of the organization. If the other department or members are busy or do not answer, the agent or member may simply go on to another department or member.
While the process of finding answers may be successful if the querying party is persistent enough, it is time consuming and inefficient. Accordingly, a need exists for a more efficient method of finding an information resource in a dynamic environment.
A method and apparatus are provided for matching resources and co-resources within a system. The method includes the steps of providing a plurality of resources and co-resources where a first type of resource of the plurality of resources are preferentially matched with a first type of co-resource of the plurality of co-resources and a second type of resource of the plurality of resources is preferentially matched with a second type of co-resource of the plurality of co-resources and where any match between a resource of the first type and a co-resource of the second type or a resource of the second type and co-resource of the first type is a non-preferential match, matching each of the plurality of resources with each respective co-resource of the plurality of co-resources, forming a tempered match from each matched resource and co-resource by associating a time of the match with the match, ordering the tempered matches based upon the associated time; and releasing at least some of the tempered matches for use within the system based upon the ordering of the tempered matches.
A profile may be associated with each of the resources and co-resources. The profiles of a resource may be a knowledge profile and the profile of the co-resource may be an information needed profile.
The system 10 has many resources and co-resources. In order to perform its intended function, the system 10 matches the knowledge profiles of resources with the information needed profiles of the co-resources. It should be noted that within the organizational context, the persons occupying the role of resources and co-resources may reverse roles depending upon the context of a contact request.
In general, the system 10 matches resources with co-resources by comparing the knowledge profile of each resource and the information needed profile of each co-resource within the system 10 and forms a signature that reflects the quality of the match. The system 10 operates dynamically in real time because only some of the resources and co-resources are present within the system 10 at any one instant. Higher quality matches may be released after only a very short predetermined time period (e.g., immediately) while poorer quality matches are allowed to remain within the system 10 for a longer predetermined period of time pending the possibility of the availability of a better match.
Release of a match in this case means that the resource and co-resource are placed into communication contact with each other. Contact may occur either automatically via a computer used for that purpose or manually by transmittal of a communication system identifier to one of the resource and the co-resource and the receiving party initiating contact with the other party.
The knowledge profile of each resource may be provided to and saved within the system 10 on a permanent or semi-permanent basis. The knowledge profile may be provided to the system 10 under a predefined format by a supervisor who enters specific information about the resource or the knowledge profile may be provided under an undefined format as descriptive information about the resource that is stored within the system 10. In the case of textual descriptive information, word searching may be used to match the knowledge profile with an information need profile.
The knowledge needed profile of each co-resource may be partially provided within the system 10 (in advance of use) and augmented as needed for each contact between a resource and co-resource. For example, where the resources and co-resources are all employees of an organization, a contact request from a co-resource may be augmented by a specific question provided by the co-resource through a computer terminal connected to the system 10. The specific question from the co-resource may be combined with a knowledge profile of the co-resource to form an overall context of the knowledge needed profile from the co-resource for contact with a resource. A contact formed from a knowledge needed profile formed in this manner may be used to form a higher quality match between the co-resource and one of the resources. A communication connection between a released match between a resource and co-resource may established through use of a connection processor within the communication system 10.
Under another illustrated embodiment, the resources may be agents of an organization and the co-resources may be clients of the organization. In this regard,
For purposes of simplicity, it will be assumed that a first memory 24 contains a list of knowledge profiles (e.g., qualifications) of resources 18, 20, 22. In this regard, it will be assumed that a respective knowledge profile file 26, 28 is provided for each resource 18, 20, 22.
Similarly, it may be assumed that a second memory 30 is provided with is list of co-resource knowledge needed profiles located in files 32, 34. In this regard, it will be assumed that a respective co-resource knowledge needed file 32, 34 is provided that describes the needs of each co-resource 12, 14, 16. The needs of the co-resources 12,14, 16 may be determined conventionally from call associated information (e.g., ANI for PSTN calls, web pages visited for internet calls, etc.). For example, it may be deduced that a call originating : from a web page would have a question that has to do with the web page. The needs of co-resources 12, 14, 16 may be further augmented by information retrieved from client files based upon the identity of the co-resource.
Turning first to terminology, an explanation will be provided of the terms used herein. Following an explanation of terms, an explanation will be provided of various illustrated embodiments of the invention.
As used herein, a source is either a resource (r) 18, 20, 22 or a co-resource (c) 12, 14, 16. A tempered resource (r,t) is a resource (r) with an associated absolute time value (t). A tempered co-resource (c,t) is a co-resource (c) with an associated absolute time value (t).
In general, sources arrive from outside the system 10 and are detected by an arrival processor 48. When a resource 18, 20, 22 or co-resource 12, 14, 16 arrives, it is available. When either type of source arrives, it is tempered by operation of a first source tempering processor 50 that pairs the source with the absolute time (t) of its arrival from a time base 36. Once a source 12, 14, 16, 18, 20, 22 is paired with an absolute time (e.g., (r,tr) or (c,tc)), the source is “inside” the system 10.
The concept of a tempered match will be considered next. A tempered match ((r,tr), (c,tc), tm) has three elements, including a tempered co-resource (c,tc), a tempered resource (r,tr) and an absolute time (tm)—The absolute time of the tempered match is the time the match is/was/may be/shall be established. The tempered match is real if tm≥tc and tm≥tr. A tempered match that is not real is a virtual tempered match.
Tempered matches are formed: from the tempered sources within the system 10. A tempered match may leave the system 10. In this case, the match is sent outside the system 10 when the match is released. The match is released either directly to one or both of the resource and co-resource who complete the call manually or to a connection processor 46 that automatically establishes a communication connection between the resource and co-resource.
The system 10 has a tempo function, T, that is performed by a tempo processor 38, which maps any pair formed: from a tempered co-resource (c,tc) and a tempered resource (r,tr) to a tempered match. The mapping process may use a matching processor 52 to first match the tempered co-resource (c,tc) with the tempered resource (r,tr). A tempering processor 56 may then create the tempered match by appending the absolute time (tm) to the match. The process of creating a tempered match may be depicted by the expression as follows.
T: ((c,tc),(r,tr)+→((c,tc),(r,tr),tm).
In other words, the tempo processor 38 uses the tempered sources to establish a tempered match.
An ordering processor 60 may adjust the absolute time to form an adjusted associated time. A release processor 54 may release the tempered matches for use within the system based upon the ordering of the tempered matches.
Inside the system 10 are three lists: 1) a list 40 of tempered co-resources, sorted by time of arrival; 2) a list 42 of tempered resources, sorted by time of arrival and 3) a list of tempered matches, sorted by time of establishment of the match. Each tempered source appears, at most, one time in its source list. Each tempered source may appear many times in the list of tempered matches, but any particular tempered co-resource and tempered resource pair will be established together in at most one match in the list of tempered resources.
The processing elements of the system 10 may insert appropriate items into any of the three lists 40, 42, 44. The system 10 may also delete appropriate items from any of the three lists 40, 42, 44. The system 10 may also sort items within any of the three lists 40, 42, 44.
A release processor 54 of the system 10 may remove tempered matches from the list of tempered matches 44 and release them outside the system 10. In real time, the system 10 runs the matching processor 52 creates tempered matches and the release processor 54 releases them to the outside. The process may include three sets of process flows accomplished by respective subroutines. As part of the first process flow accomplished by a list editor routine 60, whenever a tempered match, M, in the list of tempered matches is established at a time equal to or before the current time, the lists are edited in accordance with the match. First, any tempered match, other than M, whose co-resource is the same as M's, is deleted from the list of tempered matches. Second, any tempered match other than M, whose resource is the same as M's, is deleted from the list of tempered matches. Third, any tempered co-resource, whose co-resource is the same as M's, is deleted from the list of co-resources. Fourth, any tempered resource, whose resource is the same as M's, is deleted from the list of resources. Fifth, M is removed from the list of tempered matches and released to the outside either via operation of the release processor 54 or by operation of the release processor 54 in conjunction with the list editor routine 60.
As part of the second process flow accomplished by a resource routine 62, the lists 40, 42, 44 are edited whenever a new tempered resource, R, arrives. As a first step, the tempo processor 38 forms a new tempered match from Rand every co-resource, C, in the list of co-resources 40. Each such tempered match is inserted into the list of tempered matches 44. R is then inserted into the list of resources 42.
As part of a third process flow accomplished by a co-resource routine 64, the lists 40, 42, 44 are edited whenever a new tempered co-resource, C, arrives. As a first step, the tempo processor 38 forms a new tempered match from C and every resource, R, in the list of resources 42. Each such tempered match is inserted into the list of tempered matches 44. C is then inserted into the list of co-resources 40.
The tempo processor 38 schedules these three process flows so that at any moment only one of these activities is underway and so that for any M, R or C, the activity runs to completion before a new process flow begins. The reader should note that the list of tempered matches 44 is not a queue but a kind of temporary (and dynamic) release schedule for tempered matches.
The tempo processor 38 determines the pace at which particular tempered co-resources and tempered resources will be released from the system 10 as tempered matches. The process flows admit many refinements. For example, the second and third process flows can include their own release and cleanup activities when they discover that a new tempered match has been established at a time before a current time.
In general, a signature processor 58 within the tempo processor 38 characterizes the quality of a match between a co-resource and a resource by associating larger values of tm with poorer matches. Better matches have a sense of urgency and are associated with smaller values of tm.
In effect, the signature processor 58 adjusts (increments) the value of tm by a predetermined value that is determined from the characteristics of the resource and co-resource. The predetermined value may be calculated from the differences of arrival times of the resource and co-resource. Alternatively, the predetermined value may be selected based upon the type of resource and co-resource forming the match.
The design and use of the tempo processor 38 is based upon two assumptions. First, a decision as to whether or not a particular match is suitable at a particular time depends upon how long the resource and co-resource have been waiting for some match. (This is the dynamic assumption.) Second, it is better to wait a small amount of time when there is a chance that a more suitable match will arrive in the interim than to make a poor match against a resource or co-resource simply because it is immediately available. (This is the Stochastic assumption.)
The tempo process of the tempo processor 38 in providing tempered matches is regular if it only returns real tempered matches. If a tempo process is not regular, it is irregular.
The tempo, T, of producing tempered matches is autonomous when for any times tr, tc, tm, and any time interval h, and for any co-resource c and resource r, the following conditions are true.
If T: ((c,tc),(r,tr))+→((c,tc),(r,tr)), tm),
then T: ((c,tc+h),(r,tr+h))+→((c,tc+h),(c,tr+h)),tm+h).
That is, a shift in the arrival times of the co-resource and resource results in the same shift in the time the match was established.
If T is an autonomous process, then there is a function, f, parameterized by co-resources and resources, and mapping time intervals to time intervals described by the expression f[c,r]:h+→h′, such that
T: ((c,tc),(r,tr))+→((c,tc),(r,tr),tc+f[c,r](tc−tr)) when tc≥tr and
T: ((c,tc),(r,tr))+→((c,tc),(r,tr),tr+f[c,r](tc−tr)) when tr>tc.
Furthermore, if an autonomous tempo is regular, then f[c,r] is non-negative, for all c and r.
The function, f, that is related to the autonomous tempo of the tempo processor 38 is called the signature of the tempo (match). The signature of the match is a measure of the quality of the match. The quality of the match may be determined by matching the attributes of the resource and co-resource. The quality of the match is used to control the release of the tempered match. The signature of the match is used by the signature processor 58 to adjust the value tm.
When considering signatures, the source that arrives later (whether resource or co-resource) establishes the match, since (I) the duration returned by the signature is added to the arrival time of the later source is determined when the match is established and (2) no real tempered match can be established until after the arrival of the later source.
Following are a number of examples. In the following examples, the time interval, h, is defined as h=tc−tr, so that h is positive when the co-resource arrives after the resource, and h is negative when the resource arrives after the co-resource.
As a first example, suppose that f[c,r]: h+→0 (
As another example, suppose that f[c,r]: h+→∞. In this case, the match is established arbitrarily far into the future and the match is never available for release.
As still another example, suppose that f[c,r]: h+→1 (
As another example, assume that the signatures take the following values (
f[c,r]: h+→1, when h≥0 and
f[c,r]: h+→0, when h<0.
If the co-resource arrives after the resource, the match is established one time unit after the arrival time of the co-resource. In other words, it's as if the co-resource is willing to wait for a better match. If the resource arrives after the co-resource, then the match is established at the arrival time of the resource and the match is immediately ready for release. In other words, it's as if the resource knows a better match for it will never come along and so it immediately matches with the co-resource. This behavior overrides the co-resources “strategy” of waiting for a better match.
As another example, assume that the signatures take the following values (
f[c,r]: h+→1, when h≥0,
f[c,r]: h+→1+h, when −1<h<0 and
f[c,r]: h+→0, when h:≤−1.
In this case, if the co-resource arrives after the resource, the match is established one time unit after the arrival time of the co-resource. In other words, it's as if the co-resource is willing to wait for a better match. If the resource arrives within one time unit after the co-resource, the match is established at the time it would have been established if the resource were already present when the co-resource arrived. If the resource arrives more than one time unit after the co-resource, the match is established at the arrival time of the resource and the match is ready for release. This function creates real tempered matches.
As another example, assume that the signatures take the following values (
f[c,r]: h+→1, when h≥0,
f[c,r]: h+→1+h, when h≤−1.
If the co-resource arrives after the resource, the match is established one time unit after the arrival time of the co-resource. In other words, it's as if the co-resource is willing to wait for a better match. If the resource arrives after the co-resource, the match is established at the time it would have been established if the resource were already present when the co-resource arrived. This function creates both real and virtual tempered matches. In particular if the resource arrives more than one time unit after the co-resource, the match is not real because it is established before the arrival of the resource. Therefore this function defines an irregular tempo.
As another example, assume that the signatures take the following values (
f[c,r]: h+→0, when h≥1,
f[c,r]: h+→1−h, when 0<h<1,
f[c,r]: h+→1+h, when −1<h<0
and f[c,r]: h+→0, when h≤−1.
When the two sources arrive within one time unit of each other, the match is established one time unit after the earlier member (either c or r) of the pair arrived. Otherwise, the match is established when the later member of the pair arrives.
Consider the triangular signature, f[c,r], for the tempo T shown in
f[c,r]: h+→0, when h≥v,
f[c,r]: h+→(1−h/v)w, when 0<h<v,
f[c,r]: h+→(1−h/u), when u<h≤0 and
f[c,r]: h+→0, when h≤u.
For this signature, w is the maximum delay a source will add to its time of arrival to determine the time a match is established. This maximum is used only if the resource and co-resource arrive simultaneously.
If the co-resource arrives after the resource, the co-resource establishes the match after some delay less than w. There are three qualitatively different behaviors, depending upon the ratio of w and v.
First consider |w/v|=1. When the co-resource arrives within |v| time units of the arrival of the resource, the match is established exactly w time units after the arrival of the resource. When the co-resource arrives after |v| time units of the arrival of the resource, the match is immediately established.
Next consider |w/v|=1. When the co-resource arrives within |v| time units after the arrival of the resource, the match is established more than w time units after the arrival of the resource. When the co-resource arrives after |v| time units of the arrival of the resource, the match is immediately established.
Finally consider |w/v|>1. When the co-resource arrives within |v| time units after the arrival of the resource, the match is established less than w time units after the arrival of the resource. When the co-resource arrives after |v| time units of the arrival of the resource, the match is immediately established.
If the resource arrives after the co-resource, the resource establishes the match after some delay less than w. There are three qualitatively different behaviors, depending upon the ratio of w and v.
First consider |w/u|=1. When the resource arrives within |u| time units of the arrival of the co-resource, the match is established exactly w time units after the arrival of the co-resource. When the resource arrives after |u| time units of the arrival of the co-resource, the match is immediately established.
Next consider |w/u|<1. When the resource arrives within |u| time units after the arrival of the co-resource, the match is established more than w time units after the arrival of the co-resource. When the resource arrives after |u| time units of the arrival of the co- resource, the match is immediately established.
Finally consider |w/u|>1. When the resource arrives within |u| time units of the arrival of the co-resource, the match is established less than w time units after the arrival of the co-resource. When the resource arrives after |u| time units of the arrival of the co- resource, the match is immediately established.
Following are three detailed examples illustrating the use of tempered matching in cases involving two types of resources and two types of co-resources. These examples easily generalize, in any number of ways, to cases involving many types of resources and many co-resources. Each of the three examples involves an autonomous tempo. The essential distinction between the examples is due to a different choice of signature for their tempos. The first of these examples involves a very simple “constant preference” signature which establishes a time of match between preferred matches at the current time and establishes a time of match between less preferred matches at a fixed time interval after the current time. The second of these examples illustrates a generalization of a “first come, first matched” policy. The third of these examples is an “exponential” variation of the previous two examples. his example describes a non-trivial autonomous tempo whose signature enforces a significant and useful matching policy where the time a match is established for less preferred matches is delayed by a variable amount depending on how long a source (resource or co-resource) has been waiting in the system. As well, this virtual tempo is designed so that any source will eventually be released, provided co-sources of any type continue to arrive. Here follows the first and most detailed of these three examples.
Example 1. Shown first is a table of source arrival data and a table of release data for a tempered matching example in a simple scenario. Following the tables there are charts that illustrate the detailed steps of the first matches in the example scenario.
This example scenario can be thought to represent the following situation. The resources represent customer service agents. The co-resources represent customers. Suppose there are two kinds of agents, r1 and r2, and two kinds of customers, cl and c2, so that there are four (possibly distinct types of) signatures for a real autonomous tempo: f[cl, rl], f[cl, r2], f[c2,rl], and f[c2,r2]. Suppose the agent skills and the customer requirements are such that any type of agent can handle any type of customer, but for some other business reason (say profit or customer satisfaction) it is better to match r1 with cl and r2 with c2, even if it entails some delay, than to match r1 with c2 and r2 with c1. The choice of the four signatures quantifies the quality of the possible matches by specifying the amount of acceptable delay before releasing a matched customer-agent pal r.
In this example, a set of very simple signatures has been chosen as follows.
f[cl,r1](h)=0;
f[c2,r2](h)=0;
f[cl,r2)(h)=1;
f[c2,r1](h)=1;
The scenario can be described as including the following assumptions. There are two types of resources, {rl, r2}, and two types of co-resources, {cl, cl}. The tempo of the matching process establishes a match between either cl and rl or c2 and r2 at the current time (i.e., the arrival time of the later member of either pair) and establishes a match between cl and r2 or c2 and rl at the current time plus one.
The arrival times of resources and co-resources are determined by some stochastic process. In this example, each type of resource and co-resource is assumed to follow an exponential distribution with mean=1. That is, for each of the four types, the distribution of time-intervals between consecutive arrivals is given by the density p(t)dt=exp(−t)dt.
Following is a list of a sample of 100 consecutive arrival times generated by a Monte Carlo method using those assumptions. The time of arrival is on the left and the type of source is identified on the right.
A summary of tempered matching for the scenario presented for the samples above now follows. A tempered matching algorithm was run against this time sequence of source arrivals using the given tempo. Following is a table showing the times and types of the released matches, up to the time of the anival of the 100th source. The last column indicates the quality of the match. In this example, only one match was of poor quality. A c2 was matched with an r1 and released.
After the arrival of the 100th source, the following co-resources were still waiting in the system.
After the arrival of the 100th source, the following resources were still waiting in the system.
Below is a sequence of charts which illustrate the tempered matching process acting on the given sample sequence of sources. Each chart comprises five rectangles, including the center rectangle, the upper rectangle, the lower rectangle, the left rectangle, and the right rectangle, and have the following semantics. Sources arrive in the upper rectangle. Tempered matches are released in the lower rectangle. The co-resources in the system are shown in the left rectangle. The resources in the system are shown in the right rectangle. The tempered matches in the system are shown in the center rectangle. Each source is represented by its arrival time and a type identifier (Here, one of rl, r2,cl, or c2.) Each tempered match is represented by the time of its establishment (as determined by the tempo of the matching process) followed by the representations of the co-resource and resource the match comprises.
A more detailed description of the match releases in the sample is as follows. The first source arrives at time=0.0028457. It is a co-resource of type cl.
The first co-resource immediately enters the system and becomes available. No matches are possible because there are no resources in the system. The next source, another co-resource, arrives at time=0.176479.
The second co-resource enters the system and then a resource of type r1 arrives at time=0.4319778.
The resource immediately enters the system, and all possible co-resource/resource matches are tempered and ordered by time of establishment and time of arrival. (These matches appear in the center rectangle.)
The current time, 0.431978, is now greater than or equal to the time of establishment, 0.431978, of the tempered match at the top of the list of tempered matches in the center rectangle. That match is released and the co-resource and resource associated with that match are cleared from the system. Similarly, any tempered matches involving either of those sources are cleared from the system. The next source, a resource of type rl, arrives at time=0.5342334.
The new resource is taken in to the system and tempered against the remaining co-resource. The current time, 0.5342334, is now greater than or equal to the time of establishment, 0.5342334, of the tempered match at the top of the list of tempered matches.
So that match is released and the co-resource and resource associated with that match are cleared from the system. Another resource arrives at time=0.5490368.
That resource is taken into the system and a co-resource arrives at time=0.925951.
All matches are tempered. In this case the only match available has been established at a time=1.925951, which is greater than the current time=0.925951. (The tempo establishes the match between cl and r2 one time unit after the arrival of cl.)
The next source arrives at time=1.5244499. It is a resource of type r2. Upon this arrival, the current time=1.5244499 is less than the established time of the top match in the center rectangle. Therefore, no tempered match is released at the current time.
The resource is taken into the system. It is tempered against all the available co-resources in the system and any new tempered matches are inserted into the list of tempered matches.
The next source arrives at time=1.6745056. It is a resource of type rl. Upon this arrival, the current time=1.6745056 is less than the established time of the top match in the center rectangle. Therefore, no tempered match is released at the current time.
The resource is taken into the system. It is tempered against all the available co-resources in the system and any new tempered matches are inserted into the list of tempered matches.
Before the next source arrives at time=2.1345255, the current time reaches 1.6745056. The current time is then greater than or equal to the established time of the top match in the system, so that match is released, and that match's co-resource and resource are cleared form the system. At time=2.1345255 the next source arrives.
That source, a resource of type r2 enters the system, but no matches are possible because there are no co-resources currently in the system.
Two more resources arrive before a co-resource arrives at time=2.8617355.
That co-resource, of type cl, immediately becomes available and is tempered against all available resources. The tempo establishes the current time in any matches against resources of type r1 and the current time+1 in any matches against resources of type r2.
The tempered match against the resource arriving at 2.3149199 is at the top of the list of current matches and the time of that matches establishment is less than or equal to the current time. Therefore that match is released, and its sources are cleared from the system. The next source, a re-source of type rl, arrives at time=2.993211
The resource is taken into the system, but no matches are currently possible. A co-resource then arrives at time=4.8033558.
The co-resource is taken into the system and tempered against all available resources.
The top match is established at the current time, so it is released, its sources cleared, and a new source arrives at time=4.8334326.
However, the source arriving at time=4,8334325 is a resource rl, so no match is possible.
Another co-resource arrives at time=4.8526482.
The co-resource at time=4.8526482 is matched with the resource at time=1.5244499. Since the cmTent time is equal to or less than time=4.8526482, the match is released from the system. Another co-resource c2 arrives at time=5.0166638.
The co-resource at time=5.0166638 is matched with the resource at time=2.1345255. Since the match time is equal to or less than the current time, the match is released from the system. Another co-resource arrives at time=8.1413418.
The co-resource at time=8.1413418 is matched with the resource at time=2.5325145 and the match is released from the system. Another co-resource arrives at time=8.2544844.
The co-resource at time=8.2544844 is matched with the resource at time=3.453786 and the match is released from the system. Another co-resource arrives at time=8.8377463.
The co-resource at time=8.8377463 is matched with the resource at time=2.993211 and the match is released from the system. Another co-resource arrives at time=9.3664004.
The co-resource at time=9.3664004 is matched with all of the resources.
The co-resource at time=9.3664004 is matched with the resource at time=S.0866341 and the match is released from the system. Another co-resource arrives at time=9.6601721.
The co-resource at time=9.6601721 is matched with all of the resources.
The co-resource at time=9.6601721 is matched with the resource at time=6.9911683 and the match is released from the system. Another co-resource arrives at time=9.7568613.
The co-resource at time=9.7568613 is matched with all of the resources.
The co-resource at time=9.7568613 is matched with the resource at time=S.6265853 and the match is released from the system. Another resource arrives at time=10.110442.
The resource at time=10.110442 is added to the resource list. Another co-resource arrives at time=11.311129.
The co-resource at time=11.311129 is matched with all of the resources.
The co-resource at time=11.311129 is matched with the resource at time=8.8638217 and the match is released from the system. Another resource arrives at time=11.670576.
The resource at time=11.670576 is added to the list of resources. Another co-resources arrives at time=11.762021.
The co-resource at time=11.762021 is matched with the resource at time=4.8334326 and the match is released from the system. Another co-resource arrives at time=11.797395.
The co-resource at time=11.797395 is matched with the resource at time=5.6643754 and the match is released from the system. Another co-resource arrives at time=12.385823.
The co-resource at time=12.385823 is matched with the resource at time=8.4777979 and the match is released from the system. Another co-resource arrives at time=12.741517 and the process continues.
Example 2. Below are tables summarizing an example of tempered matching in a simple scenario. This example scenario can be thought to represent the following situation. The resources represent customer service agents. The co-resources represent customers. Suppose there are two kinds of agents, rl and r2, and two kinds of customers, cl and c2, so that there are four (possibly distinct types of) signatures for a virtual autonomous tempo: f[cl, r1], f[c1, r2, f[c2, r1, and f[c2, r2]. Suppose the agent skills and the customer requirements are such that any type of agent can handle any type of customer, but for some other business reason (say profit or customer satisfaction) it is better to match rl with c1 and r2 with c2 than to match r1 with c2 and r2 with cl. However, the business is unwilling to violate a “First come first matched” rule for either resources or co-resources unless the better and worse of the “first come” options for a match both arrived at the same or imperceptibly different times.
This business rule may be captured with tempered matching by an appropriate choice of the four signatures. For this example, the following signatures will suffice to enforce the rule:
f[cl,rl](h)=−|h|;
f[c2,r2](h)=−|h|;
f[cl,r2)(h)=−h+0.0001;
f[c2,rl](h)=−|h|+0.0001,
where 0.0001 is assumed to be an imperceptible duration of time, and !hi denotes the absolute value of h. That is, |h|=h when h>0, |h|=0 when h=0, and |h|=−h when h<0.
The signature f[cl, rl](h)=−|h| simply means that the tempo establishes the match cl and rl at the time which is the minimum of the arrival times of cl and rl. The signature f[cl, r2) (h)=−h−|h|+0.0001 simply means that the tempo establishes the match between cl and r2 an imperceptible duration of time after the minimum of the arrival times of cl and r2. Note that nearly all matches will be established at a time prior to the release time; such matches are called virtual so this is an example of a virtual tempo.
This matching strategy is a generalization of a simple “first come, first matched” strategy, and becomes that strategy when the imperceptible time delay is set to zero.
In this scenario it is assumed there are two types of resources, {rl, r2}, and two types of co-resources, {c1, c2}. The tempo of the matching process establishes a match between either cl and rl or c2 and r2 at the arrival time of the earlier member of either pair and establishes a match between either cl and r2 or c2 and rl at the arrival time of the earlier member of either pair plus an imperceptible amount of time=0.0001.
The arrival times of resources and co-resources are determined by some stochastic process. In this example, each type of resource and co-resource is assumed to follow an exponential distribution with mean=1. That is, for each of the four types, the distribution of time-intervals between consecutive arrivals is given by the density p(t)dt=exp(−t)dt.
Here is a list of a sample of 100 consecutive arrival times generated by a Monte Carlo method with those assumptions. The time of arrival is on the left and the type of source is identified on the right.
A tempered matching algorithm was run against this sequence of sources using the given tempo. Here is a table showing the times and types of the released matches, up to the time of the arrival of the 100th source. The last column indicates the quality of the match. In this sample, of 47 matches, 22 were of better quality and 25 were of worse quality. It is believed that this is not significantly different from random matching. The reader should not be surprised to observe that this “first come, first matched” strategy may not yield significant improvements in the quality of matches. The point of this example is to show that tempered matching is powerful enough to express a generalized “first come, first matched” matching strategy. Other choices of tempo do lead to significant improvements in the quality of matches.
Also note that in these virtual matches, the time of release is after the time of establishment and that the time of establishment is before the arrival of both resources
After the arrival of the 100th source, the following co-resources were still waiting in the system.
After the arrival of the 100th source, no resources were still waiting in the system.
Example 3. Below are tables summarizing an example of tempered matching in a simple scenario. This example scenario can be thought to represent the following situation. The resources represent customer service agents. The co-resources represent customers. Suppose there are two kinds of agents, r1 and r2, and two kinds of customers, c1 and c2, so that there are four (possibly distinct types of) signatures for a virtual autonomous tempo: f[c1,r1], f[c1,r2], f[c2,r1], and f[c2,r2]. Suppose the agent skills and the customer requirements are such that any type of agent can handle any type of customer, but for some other business reason (say profit or customer satisfaction) it is better to match rl with cl and r2 with c2 than to match r1 with c2 and r2 with c1. The business is willing to delay the release of matches in order to obtain a higher quality of released matches. However the business also wants to be certain that any available customer or agent eventually will be matched (assuming the complementary sources continue to arrive.) This can be assured by an appropriate choice of tempo.
This business constraint may be captured with tempered matching by an appropriate choice of the four signatures. For this example, the following signatures will suffice to enforce the constraints.
f[cl,rl](h)=−|h|;
f[c2,r2](h)=−|h|;
f[lc1,r2)(h)=−|h|+4*exp(−0.05*|h|);
f[c2,r1](h)=−|h|+4*exp(−0.05*|h|);
Here, |h| denotes the absolute value of h. That is, |h|=h when h>0, |h|=0 when h=0, and |h|=−h when h<0. Also, * denotes multiplication and exp( ) denotes the exponential function.
The signature f[cl, rl](h)=−|h| simply means that the tempo establishes the match cl and rl at the time which is the minimum of the arrival times of cl and r1. The signature f[cl, r2)(h)=−|h|+4*exp(−0.05*|h|) simply means that the tempo establishes the match between cl and r2 a duration of time after the minimum of the arrival times of cl and r2, which duration decreases exponentially with the magnitude of the difference in arrival times of the matched pair. In effect, if either a resource or a co-resource has been in the system for a long time, the next match will treat it as if the tempo were “first come, first matched.” This means all old, “stagnant” sources are eventually released from the system. Note that these stagnant matches will be established at a time prior to the release time; such matches are called virtual so this is an example of a virtual tempo. On the other hand, when sources have not been in the system too long, the better matches will be preferentially released. This non-trivial tempo illustrates some of the utility of tempered matching.
In this scenario it is assumed there are two types of resources, {rl, r2}, and two types of co-resources, {cl, c2}. The tempo of the matching process establishes a match between either cl and rl or c2 and r2 at the arrival time of the earlier member of either pair and establishes a match between either cl and r2 or c2 and rl at the arrival time of the earlier member of either pair plus an amount of time, 4*exp(−0.05*|h|). Here, h is the difference between the arrival times the matched sources.
The arrival times of resources and co-resources are determined by some stochastic process. In this example, each type of resource and co-resource is assumed to follow an exponential distribution with mean=1. That is, for each of the four types, the distribution of time-intervals between consecutive arrivals is given by the density p(t)dt=exp(−t)dt.
Below is a list of a sample of 100 consecutive arrival times generated by a Monte Carlo method with those assumptions. The time of arrival is on the left and the type of source is identified on the right.
A tempered matching algorithm was run against this sequence of sources using the given tempo. Below is a table showing the times and types of the released matches, up to the time of the arrival of the 100th source. The last column indicates the quality of the match. In this sample, of 47 matches 43 were of better quality and 4 were of worse quality. I venture this is significantly different from random matching.
Also note that many but not all of these matches are virtual matches, the time of release is after or at the time of establishment, and that the time of establishment may be before or after the arrival times of both resources.
After the arrival of the 100th source, the following co-resources were still waiting in the system.
After the arrival of the 100th source, no resources were still waiting in the system.
A specific embodiment of method and apparatus for matching resources and co-resources has been described for the purpose of illustrating the manner in which the invention is made and used. It should be understood that the implementation of other variations and modifications of the invention and its various aspects will be apparent to one skilled in the art, and that the invention is not limited by the specific embodiments described. Therefore, it is contemplated to cover the present invention and any and all modifications, variations, or equivalents that fall within the true spirit and scope of the basic underlying principles disclosed and claimed herein.
This application is a continuation of U.S. patent application Ser. No. 11/669,349, entitled “Method and System for Matching Resources and Co-Resources”, filed on Jan. 31, 2007, which is fully incorporated by reference herein.
| Number | Date | Country | |
|---|---|---|---|
| Parent | 11669349 | Jan 2007 | US |
| Child | 17395302 | US |
