The invention relates to the field of computer systems. In particular, it relates to a computer system for matching leads with providers of goods or services such as, for example, credit products.
Service providers and vendors, such as banks, credit unions, automobile dealers, and the like, offer loan and credit products to their customers. These products may include automobile loans, home mortgage loans, personal loans, student loans, credit cards, and other such financial products. Those products may often fluctuate over time, so that interest rates, down payment amounts, loan criteria, and other parameters may vary from day to day. Additionally, service providers may offer a variety of products to consumers with different criteria. For example, loans at different interest rates may be offered to consumers with better or worse credit ratings, consumers at different income levels, consumers of different ages or occupations, and so on.
Traditionally, in order to find a loan or credit product, a consumer would shop around at various providers to compare the rates or products that each provider was willing to offer. Additionally, service providers may have used mass marketing techniques to advertise their products to potential new clients. However, such techniques have limited effectiveness, because they tend to flood consumers with information, making the decision-making process difficult and inefficient.
As a result, what is needed are systems and methods for automatically optimizing the matching of consumers to service providers and vendors, to ensure that interested consumers are matched to service providers offering products with criteria that are met by the interested consumers, and preferably identifying multiple service providers in order to offer the consumer with a choice of service providers. An automated system has the advantage that it can, in real time, retrieve up-to-date product pricing and rate information and, to the extent possible, provide results to the user of the system without significant delay, thus resulting in a desirable user experience.
In one embodiment, a system for matching consumers with vendors includes a processor, a network interface in communication with the processor, a data storage device in communication with the processor, and computer-executable instructions stored in computer storage. The instructions are configured, when executed by the processor, to cause computer hardware to perform operations comprising: (1) matching a consumer lead comprising information about a consumer with one or more vendors selected from a set of vendors identified in data records stored on the data storage device; (2) sending, via the network interface, the lead to the matched vendors; (3) receiving a real-time indication of a rejection from one of the matched vendors; (4) matching the lead with a replacement vendor; and (5) sending the lead to the replacement vendor.
In one embodiment, a method for matching consumers with vendors includes the steps of: (1) using a computer processor to match a consumer lead comprising information about a consumer with one or more vendors selected from a set of vendors identified in data records stored on a data storage device in communication with the computer processor; (2) sending, via a network interface in communication with the computer processor, at least a portion of the lead to the matched vendors; (3) receiving a real-time indication of a rejection from at least one of the matched vendors; (4) using the computer processor to match the lead with at least one replacement vendor; and (5) sending, via the network interface, the lead to the replacement vendor.
This Summary section does not define or limit the invention. Rather, it provides a concise summary of only some embodiments. The inclusion of particular components, features, or method steps in this Summary section does not indicate, suggest, or imply that those components, features, or method steps are required in every embodiment of the invention. Similarly, the description of particular components, features, or method steps in the Detailed Description section does not indicate, suggest, or imply that those components, features, or method steps are required in every embodiment of the invention. The claims define the scope of the invention.
Various embodiments of the invention will now be described, with reference to the accompanying figures.
An embodiment of a computer system configured to operate embodiments of the invention is depicted in
The system includes one or more software modules 104. In general, the words “module,” “function,” and similar terms, as used herein, refer to logic embodied in hardware or firmware, or to a collection of computer-executable software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, C or C++. The computer-executable instructions of a software module are generally stored in computer-readable storage on a tangible medium, such as, for example, a compact disc, a hard disk drive, a flash drive, or the like. The computer-executable instructions define operations that are performed by computer hardware when the instructions are executed by a computer processor. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC. Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.
In some embodiments, the computing devices 101 include and/or communicate with a database module or data source 108 or 112. The database module or data source may be implemented using one or more databases, such as a relational database, such as Sybase, Oracle, CodeEase and Microsoft® SQL Server as well as other types of databases, such as, for example, a flat file database, an entity-relationship database, and object-oriented database, and/or a record-based database. The database may be operated on the same computing device or devices as other modules 108, or they may be operated on different computing devices 112. In some embodiments, some or all of the databases are operated by an entity different from the entity operating the analysis. The databases may be operated by an independent service provider.
In one embodiment, each of the computing devices are IBM, Macintosh, or Linux/Unix compatible. In another embodiment, the computing devices comprise a server, a laptop computer, a cell phone, a personal digital assistant, a kiosk, an interactive voice response device, a voice response unit, or an audio player, for example. In one embodiment, the computing devices include one or more CPUs 105, which may each include microprocessors. The computing devices may further include one or more memory devices 107, such as random access memory (RAM) for temporary storage of information and read only memory (ROM) for permanent storage of information, and one or more mass storage devices 102, such as hard drives, diskettes, or optical media storage devices. In one embodiment, the modules are in communication via a bus system, such as, for example, a bus system using a Peripheral Component Interconnect (PCI), Microchannel, SCSI, Industrial Standard Architecture (ISA) or Extended ISA (EISA) architecture. In some embodiments, components of the computing devices communicate via a network, such as a local area network that may be secured.
The computing devices are generally controlled and coordinated by operating system software, such as the Windows 95, Windows 98, Windows NT, Windows 2000, Windows XP, Windows Vista, Linux, SunOS, Solaris, PalmOS, Blackberry OS, or other compatible operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In other embodiments, the computing devices may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, and I/O services, and provide a user interface, such as a graphical user interface (“GUI”), among other things.
The computing devices may include one or more commonly available input/output (I/O) devices and interfaces 106, such as a keyboard, mouse, touchpad, microphone, and printer. Thus, in one embodiment the computing devices may be controlled using the keyboard and mouse input devices, while in another embodiment the user may provide voice commands to the computing devices via a microphone. In one embodiment, the I/O devices and interfaces include one or more display device, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, and multimedia presentations, for example. The computing devices may also include one or more multimedia devices, such as speakers, video cards, graphics accelerators, and microphones, for example.
In one embodiment, the I/O devices and interfaces provide a communication interface to various external devices and the communications medium via wired or wireless communication links. For example, the computing devices may be configured to communicate with the communications medium using any combination of one or more networks 111, including LANs, WANs, or the Internet, for example, via a wired, wireless, or combination of wired and wireless communication links. The communication links thus enable the computing devices to communicate with, among other things, external user computing devices 109 and 110.
An embodiment of a computer system in accordance with one embodiment is shown in
In an embodiment, the system 202 includes a rematch engine 203. The rematch engine is configured to perform the rematching methods described in this specification, including, for example, those described with reference to
In an embodiment, the system 202 includes a web interface 204 configured to serve web pages to users 201 wishing to use the system. The web interface 204 also receives inputs from users and provides those inputs to the rematch engine 203, to be used for the rematching methods. For example, the inputs received from the web interface 204 may be used to generate leads based on personal information provided by users 201. The web interface may be configured to communicate over a public network such as the Internet, or over a private network such as a LAN. In addition or alternatively to web interface 204, embodiments of the invention may include other interfaces for communicating with users 201, such as an email interface, an audio interface, a touch-tone telephone system, or other similar interfaces known to those of ordinary skill in the art. Furthermore, although the web interface or other interfaces may be used to receive personal information from users directly, this need not be the only source of personal information about users. The system 202 may access internal databases or external databases to gather demographic information, credit records, addresses, or other personal information relating to users. This “external” personal information may be gathered, for example, by identifying matching records against personal information provided by the user.
Another interface used by the system 202 for communicating with users in an embodiment is email system 205. This email system receives data from the rematch engine 203 to be sent out to users 201 who connect to the system. In some embodiments, the rematch engine 203 provides the email system 205 with results from performing a loan rematching method, and the email system 205 composes an email based on those results to be sent to the appropriate user. Those of ordinary skill in the art will understand that other methods of communicating those results to users may be employed in addition or alternatively to the email system 205, including, for example, a web-based system, a telephone system, a text messaging system, an instant messaging system, or the like. Additionally, the email system or other communication system may be configured to send out information to users immediately, or it may batch multiple communications and send them out on a periodic basis, such as every few minutes.
An embodiment includes monitoring interface 206, which is configured to monitor the performance and activities of the rematch engine 203. The monitoring interface 206 may record information including requests from users coming in from the web interface 204, outgoing communications through the email system 205, communications with the B2B delivery system 207, communications with databases 208, 209, and/or 210, or other processes or algorithms performed by the rematch engine 203. The monitoring interface may store its results in one or more log files, it may email the results to system administrators, or it may process the monitoring results in other ways known to those of skill in the art.
In an embodiment, the system 202 includes a Business-to-Business (B2B) delivery system configured to transmit data between the rematch engine 203 and various service providers 211. The B2B delivery system 202 communicates via a network interface, which may be the same network interface as used by the web interface 204 and email system 205, or any or all of them may use separate network interfaces. The B2B delivery system 207 may transmit information about leads to service providers 211, who offer various loan or credit products such as auto loans, credit cards, mortgages, or similar products, in which users 201 may be interested. In that respect, the 13213 delivery system 207 may employ specialized protocols to communicate with service providers 211, or it may employ standard network protocols such as HTTP.
In an embodiment, the rematch engine 203 and/or other components of the system 202 may utilize one or more databases. For example, a results database 208 may be used to store the results of the rematch methods performed by the rematch engine 203. Also, a plans database 209 may be used to store information about service providers 211 and various plans and products offered by those service providers. Databases may be internal to the system, or they may be external such as external databases 210, which may be external because they are hosted by a company different from the one operating the rematch system 202, or for other reasons such as efficiency. Any of the databases may be of various types of databases, including a SQL database or other relational database, a flat or hierarchical structure of files, a single flat-file store, a key-value mapping system, or other forms of data storage known to those of ordinary skill in the art.
An embodiment includes plans database 209. This plans database may include information about products offered by service providers 211, the products being, for example, loan offerings, credit cards, mortgages, or similar products. Although this specification generally discusses products being loans such as auto loans, it is contemplated that the products may be other products, such as goods and/or services. In an embodiment, the plans in the plans database 209 include criteria for whether a person qualifies for a particular plan. The criteria may be based on, for example, a person's credit score or credit history, personal information, demographic information, or other information about the individual. A service provider may offer only a single plan or may offer multiple plans which may have different criteria. This is useful, for example, to support different plans for people meeting different criteria, such as people having different credit scores, as a service provider would then be able to offer, for example, auto loans with different rates based on credit scores. Additionally, plans may be associated with a bounty value, that is, an amount that the service provider associated with the plan is willing to pay to an operator of the rematch engine in exchange for the rematch engine providing the service provider with a set of requested personal information about an individual, otherwise known as a lead. It may be the case that the service provider is willing to pay a bounty value if the rematch engine identifies a lead matching the criteria of the plan. The bounty value may be fixed, or it may be adjusted depending on the nature of the lead or on other factors.
Although plans may be stored in a database such as plans database 209, plans need not be stored in a database. In an embodiment, plans are dynamically received from service providers upon a request from the rematch system 202 to the service providers 211. For example, upon receiving a request from a user 201, the rematch engine may transmit some personal information about the user to some or all of the service providers 211. Such “dynamic” plans may only have identifying information stored in the database sufficient to inform the rematch engine that the service provider should be contacted in order to retrieve the full specification of the plans, or may have additional information but still require further data from the service provider before they can be fully considered. One use for dynamic plans, for example, is for plans where the pricing or other factors such as interest rates for the plans are highly volatile. The dynamic plan scheme would allow for the rematch engine to retrieve the most up-to-date pricing or rates for those plans at the time of the user request.
In one embodiment, as part of determining the bounty that each service provider is willing to pay for a lead, the system may transmit some of the information contained in the lead to multiple service providers in order to obtain an instant bid from those service providers. Preferably, in such embodiments, the lead information sent to the service providers includes enough information to allow the service provider to determine the value of the lead to the service provider without providing enough information to the service provider to allow the service provider to contact the consumer associated with the lead. For example, the lead information may include general information about the type of good or service desired by the consumer and information about the consumer, such as income, credit score, and the like, that may assist the service provider in determining the value of the lead, but may not include the name of the consumer or contact information of the consumer. Preferably, each service provider has an automated system, which may include software, for processing the lead information, for generating a bid of what the service provider is willing to pay for the lead, and for transmitting the bid to the matching system as part of an electronic message. The system may then take service provider bids into account in the process of matching the consumer leads to service providers. Such a system for receiving bids may be known as an instant bid or ping-post system.
A method performed by an embodiment is shown in
In accordance with this method, eligible plans are first ranked at step 301. In an embodiment, plans are ranked by total bounty value. The bounty value may be determined based upon information previously submitted by service providers or may be determined based upon an instant bid or ping-post system, as previously described. Other factors may be used to rank plans, however, such as the closeness of the match between the user, the reliability of the associated service provider, the frequency or infrequency of use of the service provider, or other factors, or a combination of factors.
At step 302, the top-ranked plans are selected for processing. In various embodiments, the number of plans selected may be one plan or a fixed number of plans, or plans may be selected based on a threshold value based on the rankings. Although the method of
At step 303, leads are sent to service providers associated with the top-ranked plans selected from step 302. In an embodiment, the leads are sent via the B2B delivery system. The leads are generally constructed by the rematch system to include appropriate personal information required by the service providers. As a result, the leads may follow a standard format, or they may vary by each service provider depending on that service provider's requirements. In an embodiment, the lead is formatted using a standard file format such as XML, in order to facilitate interoperability of systems.
In one embodiment, the sending of leads to service providers comprises sending a complete lead to the service providers. As used herein, a complete lead is one that contains sufficient consumer information that a service provider is able to contact the consumer associated with the lead in order to offer to provide the good or service desired by the consumer. Alternatively, the sending of leads to service providers comprises sending a partial lead that includes information to allow the service providers to accept or reject the lead. In such embodiments, the complete lead may be sent to those service providers that accept the lead, and may not be sent to any service providers that reject the lead. Sending the complete lead only to those service providers that accept the lead may advantageously reduce abuses of the system, such as, for example, rejecting a lead but still contacting the consumer in order to offer to provide the good or service desired by the consumer.
At step 304, the system determines whether any service providers have rejected the lead. In one embodiment, the system makes this determination, at least in part, by receiving electronic messages from service providers indicating whether each service provider accepts or rejects the lead. Preferably, each service provider has a lead response module that is configured to determine, upon receipt of the lead by the service provider, whether the lead is acceptable to the service provider. Preferably, a service provider's lead response module performs automated operations, such as checking whether the lead meets internal criteria, to determine whether the lead is acceptable. A service provider may reject a lead for a number of reasons, including, for example, that the lead is a duplicate of a lead that the service provider already has, that the lead matches or fails to match one or more filters, that a threshold number of leads matching a particular profile have already been identified (the lead profile has “capped out”), or some other reason. Preferably, a service provider's lead response module is configured to accept or reject a lead nearly instantaneously, such that lead rejections can be received by the system sufficiently quickly so that the system can match the lead with another service provider that will accept the lead quickly enough to inform the user which service providers the user has been matched with substantially without delay and without interruption to the user's browsing session. In addition, it is preferable that the re-matching process is completed without the user knowing or suspecting that a lead has been rejected by a service provider.
Generally, a service provider can accept a lead or reject it, and the service provider may or may not provide a reason for rejecting the lead. Preferably, the service provider accepts or rejects the lead by sending an electronic message to the system that indicates acceptance or rejection. If a lead is rejected, the rejection message may include a rejection code that indicates a reason for the rejection, but such a code is not required. Alternatively or additionally, the system may be designed to tolerate errors on the service provider's side that may cause the system to not receive any response from the service provider. In one embodiment, the system is configured with a timeout, and if a response is not received before the timeout, then the service provider is treated as having provided no response. In one embodiment, non-responses are treated as rejections. Alternatively, non-responses may be treated as acceptances. Some embodiments of the system may be equipped to process a response that is received after a timeout, such as, for example, by sending a lead to an additional matched service provider when the system receives an acceptance from that service provider after the timeout period, or performing a supplemental match of another service provider when the system receives a rejection from a matched service provider after the timeout period. It will be appreciated, however, that some embodiments may not process responses received after a timeout period because such processing may be disruptive. For example, in some cases it is desirable to notify the user of all of the matched service providers during the user's live session, and a user may have already terminated his or her live session when a response is belatedly received by the system. Thus, while it is advantageous in some embodiments to provide for processing of delayed responses, it is not a requirement of every embodiment.
If, at step 304, the service providers accept the lead, then the method proceeds to step 305, where a response is prepared for the user. The response, in this case, may indicate that the various plans matched, and it may contain information about the service providers and the plans to which the user was matched. The response may also provide contact information for the service providers. The response may be provided by a variety of communication media. In one embodiment, the response is provided by displaying a web page to the user during the user's live session. Advantageously, such a response provides immediate information to the user regarding which service providers have been matched with the user. However, in other embodiments in which such immediate response is not as important, the response may be provided by email or other means. Thus, the user can be provided with real-time feedback where appropriate, but is not constrained to wait for a web page to load in the case that the method takes longer than desirable to execute.
If, on the other hand, one or more of the service providers reject the lead or otherwise do not accept it at step 304, the system proceeds to determine if there are further plans to consider, at step 306. In general, these would be plans that fell lower in the rankings than the originally selected plans. However, in some embodiments it is possible for multiple plans to have the same rank and, in such embodiments, the newly selected plans may have the same rank as at least one of the originally selected plans. In cases in which multiple plans have the same rank, the system may break ties by random selection or by another method.
If there are no further plans to consider, then the method proceeds to step 305, where a response is prepared for the user. In this case, if no plans were matched to the user, the user is provided with appropriate information. In an embodiment, the user is provided with default information relating to the requested type of product that the user was seeking. For example, if the user was looking for an auto loan but did not match any auto loans, the user may be provided with a general advertisement for auto loans. Of course, this default information need not be displayed only when no plans were matched to the user; instead, the default information may be displayed at any appropriate time.
If there are further plans to consider at step 306, then the method proceeds to select the next most highly ranked plans, at step 307. In an embodiment, only a sufficient number of plans are selected to fill in the number of plans that were rejected at step 304. In this way, the number of matched plans will not exceed a certain maximum number. Once those alternate plans are selected, the method returns to step 303 to perform rematching on those plans. Thus, in an embodiment, the matching process continues until a sufficient number of plans are matched to the user or the list of plans is exhausted. In other embodiments, other conditions may be used to determine when to terminate the rematching process, including, for example, a timeout.
Because the rematching process may iterate multiple times, a response to the user may be prepared optionally either only once after the process completes, or at various times during the process. For example, the user may be notified once the first iteration of the rematching process completes and then receive updates whenever additional products are matched to the user.
In preferred embodiments, the system provides users with real-time responses. However, in some circumstances, real-time responses may not be provided because more time may be needed to receive responses from the service providers. For example, if a user is visiting the rematch system via a web interface, the user may not be willing to wait for a long period of time to receive a response. However, the service providers may require longer than the user is willing to wait, to respond to the rematch system. In order to solve this problem, a method such as the one shown in
In accordance with the method of
At step 402, a computer processor waits for the earlier of the completion of the rematch process or the expiration of a timeout period. The timeout period expiration may be detected by a thread running independently on the rematch system, or it may be detected based on a processor interrupt. The method next determines, at step 403, whether the rematch process completed before the timeout period expired. If the rematch process did complete, then a web page may be transmitted to the user confirming the results of the rematch process, at step 404. Additionally, at step 405, a confirmation email with the match results may be transmitted to the user. The contents of this email and web page may depend on the results of the rematch process.
If, at step 403, it is determined that the rematch process did not complete before the timeout period expired, then at step 406, a processing page is transmitted to the user. The processing page may be used to indicate that the rematch process is still ongoing, and it may include partial results. In this way, regardless of whether the rematch process completes before the timeout period, the user may be sent a real-time notification that their request is being processed. After the processing web page is displayed, a confirmation email may be sent to the user at step 405 indicating the status and/or results of the rematch process. The email may be sent after the entire rematch process completes, or one or more emails may be sent to keep the user apprised as to the status of the request.
In an alternate embodiment, the real-time processing described above may be performed by installing code throughout the rematch engine. The installed code would be configured to detect, when it is executed, whether a timeout period has expired. If the timeout period has expired when that code is run, then the code may provide similar notifications to the user, and it may then cause the rematch engine to branch to executing a different portion of instructions to complete the execution of the rematching process. In this way, the rematching engine is also not prematurely terminated, but the user is able to receive a real-time response to the submitted request.
A method of identifying plans to be used for some embodiments of the rematching process is shown in
At step 503, the mix of plans is inspected to determine if any of those plans are dynamic plans. As explained previously, the information for a dynamic plan is retrieved from a service provider. If there are no dynamic plans in the mix, then the list of plans may be directly returned to the rematch engine, at step 504. However, if there are dynamic plans to be considered, then the method proceeds to step 506, in which the corresponding service providers are pinged for dynamic plan parameters. This ping process may be performed over the B2B delivery system, using a protocol agreed upon between the rematch system and the service provider. In response, the dynamic plan parameters are sent back to the rematch system, at step 507. Once the rematch system receives those parameters, it adds the dynamic plans to the mix of plans, and the full set of plans can be returned at step 504. The set of selected plans is then used to perform matching at step 505, in accordance with the various methods described herein, such as with regard to
If some or all of the matched plans are indicated as “batched plans,” then the matching engine understands this to mean the service provider has requested that those plans are to be sent in batches at regular time intervals. In this case, the method may proceed to step 604, where leads are created for the selected plans. The leads include personal information about the requesting user, based on information received about the user from either the user directly or other external or internal data sources. Once the leads are prepared, then they may be batched and queued for delivery at step 605. They may be batched with other leads to be sent to the same service provider, in order to provide for compact network transactions. The delivery may occur at specified time intervals, and may be performed in accordance with an automated scheduling system such as a cron daemon. Additionally, once this is done, the user may be notified by email or web page response of the resulting activity.
If the determination at step 602 indicates that some or all of the plans are to have leads delivered in real time, then the system proceeds to step 606 for real-time delivery of leads. The rematch engine determines the best plan, based on total bounty value of that plan or other factors, as described previously. It then creates a lead based on information about the user, and at step 607, the lead is transmitted to the appropriate service provider via the B2B delivery system or other means. The system then awaits a response from the service provider at step 608, and it makes a determination based on the response received.
If the lead is successfully matched, then the method proceeds to step 609 and a match web page may be displayed. Additional information may be communicated to the user by email. If the service provider rejects the lead or an error such as a timeout is otherwise detected, then the method may proceed to step 610, where a processing web page is transmitted to the user, as described previously. Then, at step 611, control is transferred to an asynchronous or background process, such as that described in
If a rematching process is unable to complete prior to a specified timeout, then in an embodiment, an asynchronous or background process may be performed such as that shown in
At step 701, the list of selected plans is received. At step 702, the selected plans are analyzed. If no plans are selected, then a fallback matching algorithm is employed, at step 703. One such fallback algorithm is described with respect to
If some or all of the selected plans are batch plans, then in a manner analogous to that described above, leads are created at step 704 and the leads are batched for delivery at step 705. If some of the plans are indicated to have leads delivered in real time, then the method proceeds to step 704, where the best plan is selected and a lead is generated for that plan. At step 705, the created lead is transmitted via the B2B delivery system to the appropriate service provider. At step 706, the system awaits a response from the service provider. If the lead is successfully matched, then an order confirmation email (OCE) or other communication is sent to the user, indicating that the selected plan matched.
It on the other hand, the service provider rejects the lead or otherwise causes an error, then the method proceeds to step 708. At this step, the service provider and all plans associated with that service provider may be removed from the mix of potential plans. This may be done on the assumption that if one lead for a service provider did not match, then other leads are likely not to match for the same service provider. This may also be the case if the service provider is sent the lead not in conjunction with any particular plan, but the service provider is sent the lead generally to determine if it has any matching plan. In alternate embodiments, only the non-matching plan is removed, but other plans from the same service provider are retained. It will be understood that, in other methods and processes described throughout this specification, the failure of a lead to match for a given service provider may result in the rematch engine not considering other plans for that same service provider.
After the appropriate plans are removed from the mix in step 708, the method may return to step 701 or step 704 to start the rematch process and attempt to match the next best lead. Because this process is asynchronous, it may continue on for as long as necessary, if that is desirable, until a sufficient number of leads are matched or until the list of selected plans is exhausted. Other considerations, such as the need to conserve network or processor resources, may be reason in some embodiments not to allow the rematch process to continue on until full completion.
If no plans are selected for consideration by the rematch engine, then some embodiments may employ a fallback matching procedure such as that described in
If no best fixed price plan exists, then the method proceeds to identify the best dynamic plan, at step 805. The dynamic plan may be selected according to criteria as described above. If a best dynamic plan is identified, then the best dynamic plan is selected at step 806, and the method proceeds to step 803 to have the lead status updated and then to step 804 to have the lead batched and queued for delivery. On the other hand, if no best dynamic plan is identified, then the method concludes with no match, at step 807. At that point, the method may take no further actions, or the user may be notified that no match could be found. The user notification may be sent based on whether a previous notification was already sent to the user, in order to avoid sending duplicate or redundant messages.
In this disclosure, the use of the phrase “service provider” should not be interpreted strictly to suggest that the systems and methods disclosed herein cannot be used to match consumers with vendors of goods, as opposed to services. Rather, it will be understood by a skilled artisan that the systems and methods disclosed herein can match consumers with vendors of goods, services, or both. Thus, the phrase “service provider” herein is used interchangeably with the term “vendor,” and should be interpreted broadly to include any vendor that sells (or rents) goods, provides a service, or both.
In an embodiment, a rematch method is performed as shown in
Next, at step 902, the generated lead is sent to the vendors to which the lead was matched. The lead may be sent using a B2B delivery system over a network, to be received at the vendors' server or other computer. This allows the vendor's server to perform additional processing to determine how to handle the lead. In an embodiment, the vendor's server is configured to respond to the lead in an efficient manner, so that the response is received within a certain period of time to allow for real-time delivery of leads on the rematch engine's end. However, the processing done on the vendor's server may be out of the control of the rematch engine or the operator of the rematch system, so it may not always be the case that the vendor's server may be configured to provide a response within a certain amount of time.
At step 903, a real-time rejection is received from a vendor. The rejection may be indicated in a status code sent in accordance with a protocol used by the B2B delivery system. Alternately, the vendor may indicate an error in processing the lead, or it may fail to respond, causing the rematch engine to determine that a timeout has occurred. The vendor may include a reason or explanation for why it rejected the lead. In some embodiments, the system may use the reason for rejection to improve further matching, such as by removing other selected plans or vendors that are likely or certain to reject the lead for the same or similar reasons.
At step 904, a replacement vendor is identified in response to the rejection being received. It need not be the case that every vendor to which the lead was sent during step 902 reject the lead before step 904 is performed; rather, a replacement vendor may be identified if one or more of the vendors reject the lead, even while other vendors accept it. This allows for a full set of vendors to be matched to the lead, thus ensuring a high bounty return to the operator of the rematch engine. The replacement vendor may be identified based on various criteria described previously, such as a total bounty value associated with a plan for that vendor. At step 905, the lead is sent to the replacement vendor. In an embodiment, the lead is sent using the B2B delivery system as described previously.
Although particular embodiments have been described generally and in detail throughout this specification, it is not intended that the invention be limited to the particular embodiments described herein. Those of ordinary skill in the art will understand that modifications may be made to any part or the whole of the disclosed embodiments, and that elements of the embodiments may be combined or removed within the spirit of the invention. Accordingly, the invention should not be construed as limited by the foregoing disclosure, but rather should be understood as having the scope specified by the claims that follow.
This application claims priority to U.S. Provisional Patent App. No. 61/330,285, filed Apr. 30, 2010, entitled “SYSTEM AND METHOD OF RE-MATCHING REJECTED LEADS,” which is hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4982346 | Girouard et al. | Jan 1991 | A |
5056019 | Schultz et al. | Oct 1991 | A |
5353218 | DeLapa et al. | Oct 1994 | A |
5454030 | de Oliveira et al. | Sep 1995 | A |
5459306 | Stein et al. | Oct 1995 | A |
5504675 | Cragun et al. | Apr 1996 | A |
5521813 | Fox et al. | May 1996 | A |
5583763 | Atcheson et al. | Dec 1996 | A |
5621812 | Deaton et al. | Apr 1997 | A |
5628004 | Gormley et al. | May 1997 | A |
5649114 | Deaton et al. | Jul 1997 | A |
5692107 | Simoudis et al. | Nov 1997 | A |
5696907 | Tom | Dec 1997 | A |
5745654 | Titan | Apr 1998 | A |
5774868 | Cragun et al. | Jun 1998 | A |
5774870 | Storey | Jun 1998 | A |
5794210 | Goldhaber | Aug 1998 | A |
5802142 | Browne | Sep 1998 | A |
5819226 | Gopinathan et al. | Oct 1998 | A |
5842178 | Giovannoli | Nov 1998 | A |
5857175 | Day et al. | Jan 1999 | A |
5864822 | Baker, III | Jan 1999 | A |
5878403 | DeFrancesco et al. | Mar 1999 | A |
5884287 | Edesess | Mar 1999 | A |
5884289 | Anderson et al. | Mar 1999 | A |
5926800 | Baronowski et al. | Jul 1999 | A |
5930764 | Melchione et al. | Jul 1999 | A |
5933813 | Teicher et al. | Aug 1999 | A |
5953707 | Huang et al. | Sep 1999 | A |
6009415 | Shurling et al. | Dec 1999 | A |
6029139 | Cunningham et al. | Feb 2000 | A |
6029149 | Dykstra et al. | Feb 2000 | A |
6029154 | Pettitt | Feb 2000 | A |
6067525 | Johnson et al. | May 2000 | A |
6078892 | Anderson et al. | Jun 2000 | A |
6094643 | Anderson et al. | Jul 2000 | A |
6119103 | Basch et al. | Sep 2000 | A |
6208979 | Sinclair | Mar 2001 | B1 |
6233566 | Levine | May 2001 | B1 |
6254000 | Degen et al. | Jul 2001 | B1 |
6269325 | Lee et al. | Jul 2001 | B1 |
6282517 | Wolfe et al. | Aug 2001 | B1 |
6321205 | Eder | Nov 2001 | B1 |
6324524 | Lent et al. | Nov 2001 | B1 |
6330546 | Gopinathan et al. | Dec 2001 | B1 |
6385594 | Lebda et al. | May 2002 | B1 |
6393406 | Eder | May 2002 | B1 |
6418436 | Degen et al. | Jul 2002 | B1 |
6430539 | Lazarus et al. | Aug 2002 | B1 |
6513018 | Culhane | Jan 2003 | B1 |
6529878 | De Rafael et al. | Mar 2003 | B2 |
6542894 | Lee et al. | Apr 2003 | B1 |
6597775 | Lawyer et al. | Jul 2003 | B2 |
6611816 | Lebda et al. | Aug 2003 | B2 |
6615193 | Kingdon et al. | Sep 2003 | B1 |
6714918 | Hillmer et al. | Mar 2004 | B2 |
6782390 | Lee et al. | Aug 2004 | B2 |
6823319 | Lynch et al. | Nov 2004 | B1 |
6839682 | Blume et al. | Jan 2005 | B1 |
6850606 | Lawyer et al. | Feb 2005 | B2 |
6868389 | Wilkins et al. | Mar 2005 | B1 |
6873979 | Fishman et al. | Mar 2005 | B2 |
6901406 | Nabe et al. | May 2005 | B2 |
6925441 | Jones, III et al. | Aug 2005 | B1 |
7006614 | Feinberg et al. | Feb 2006 | B2 |
7028052 | Chapman et al. | Apr 2006 | B2 |
7035699 | Anderson et al. | Apr 2006 | B1 |
7043531 | Seibel et al. | May 2006 | B1 |
7047251 | Reed et al. | May 2006 | B2 |
7096205 | Hansen et al. | Aug 2006 | B2 |
7096220 | Seibel et al. | Aug 2006 | B1 |
7136448 | Venkataperumal et al. | Nov 2006 | B1 |
7139732 | Desenberg | Nov 2006 | B1 |
7212995 | Schulkins | May 2007 | B2 |
7228284 | Vaillancourt et al. | Jun 2007 | B1 |
7234156 | French et al. | Jun 2007 | B2 |
7263506 | Lee et al. | Aug 2007 | B2 |
7277875 | Serrano-Morales et al. | Oct 2007 | B2 |
7283974 | Katz et al. | Oct 2007 | B2 |
7296734 | Pliha | Nov 2007 | B2 |
7305364 | Nabe et al. | Dec 2007 | B2 |
7314167 | Kiliccote | Jan 2008 | B1 |
7333976 | Auerbach et al. | Feb 2008 | B1 |
7340410 | Vaillancourt et al. | Mar 2008 | B1 |
7343149 | Benco | Mar 2008 | B2 |
7379913 | Steele | May 2008 | B2 |
7383215 | Navarro et al. | Jun 2008 | B1 |
7428509 | Klebanoff | Sep 2008 | B2 |
7433855 | Gavan et al. | Oct 2008 | B2 |
7458508 | Shao et al. | Dec 2008 | B1 |
7509117 | Yum | Mar 2009 | B2 |
7512221 | Toms | Mar 2009 | B2 |
7542993 | Satterfield et al. | Jun 2009 | B2 |
7546243 | Kapadia et al. | Jun 2009 | B2 |
7548886 | Kirkland et al. | Jun 2009 | B2 |
7556192 | Wokaty, Jr. | Jul 2009 | B2 |
7562184 | Henmi et al. | Jul 2009 | B2 |
7562814 | Shao | Jul 2009 | B1 |
7575157 | Barnhardt et al. | Aug 2009 | B2 |
7581112 | Brown et al. | Aug 2009 | B2 |
7610216 | May et al. | Oct 2009 | B1 |
7620596 | Knudson et al. | Nov 2009 | B2 |
7623844 | Herrmann et al. | Nov 2009 | B2 |
7630933 | Peterson et al. | Dec 2009 | B2 |
7657569 | Semprevivo et al. | Feb 2010 | B1 |
7664668 | Lissy et al. | Feb 2010 | B2 |
7668725 | Alston | Feb 2010 | B2 |
7668769 | Baker et al. | Feb 2010 | B2 |
7672865 | Kumar et al. | Mar 2010 | B2 |
7686214 | Shao et al. | Mar 2010 | B1 |
7690032 | Peirce | Mar 2010 | B1 |
7708190 | Brandt et al. | May 2010 | B2 |
7725300 | Pinto et al. | May 2010 | B2 |
7752054 | Anthony-Hoppe et al. | Jul 2010 | B1 |
7752236 | Williams et al. | Jul 2010 | B2 |
7761384 | Madhogarhia | Jul 2010 | B2 |
7778885 | Semprevivo et al. | Aug 2010 | B1 |
7788147 | Haggerty et al. | Aug 2010 | B2 |
7788152 | Haggerty et al. | Aug 2010 | B2 |
7793835 | Coggeshall et al. | Sep 2010 | B1 |
7801811 | Merrell et al. | Sep 2010 | B1 |
7801843 | Kumar et al. | Sep 2010 | B2 |
7802104 | Dickinson | Sep 2010 | B2 |
7805362 | Merrell et al. | Sep 2010 | B1 |
7827115 | Weller et al. | Nov 2010 | B2 |
7856494 | Kulkarni | Dec 2010 | B2 |
7912770 | Haggerty et al. | Mar 2011 | B2 |
7954698 | Pliha | Jun 2011 | B1 |
7962347 | Anthony-Hoppe et al. | Jun 2011 | B2 |
7962501 | Semprevivo et al. | Jun 2011 | B1 |
7970672 | Mendelovich et al. | Jun 2011 | B2 |
7970690 | Diana et al. | Jun 2011 | B2 |
7991689 | Brunzell et al. | Aug 2011 | B1 |
8060424 | Kasower | Nov 2011 | B2 |
8135607 | Williams et al. | Mar 2012 | B2 |
8175966 | Steinberg | May 2012 | B2 |
8214262 | Semprevivo et al. | Jul 2012 | B1 |
8271313 | Williams et al. | Sep 2012 | B2 |
8285656 | Chang et al. | Oct 2012 | B1 |
8346658 | Curry et al. | Jan 2013 | B1 |
8533002 | Mesaros | Sep 2013 | B2 |
8533038 | Bergh et al. | Sep 2013 | B2 |
8566141 | Nagdev et al. | Oct 2013 | B1 |
8606626 | DeSoto | Dec 2013 | B1 |
8688724 | Semprevivo et al. | Apr 2014 | B1 |
9110916 | Semprevivo et al. | Aug 2015 | B1 |
20010014868 | Herz et al. | Aug 2001 | A1 |
20010047289 | Mckee et al. | Nov 2001 | A1 |
20020007343 | Oyama et al. | Jan 2002 | A1 |
20020035504 | Dver et al. | Mar 2002 | A1 |
20020035568 | Benthin et al. | Mar 2002 | A1 |
20020038312 | Donner et al. | Mar 2002 | A1 |
20020059095 | Cook | May 2002 | A1 |
20020072975 | Steele et al. | Jun 2002 | A1 |
20020077964 | Brody et al. | Jun 2002 | A1 |
20020077998 | Andrews et al. | Jun 2002 | A1 |
20020082892 | Reffel et al. | Jun 2002 | A1 |
20020087460 | Hornung | Jul 2002 | A1 |
20020099649 | Lee et al. | Jul 2002 | A1 |
20020128960 | Lambiotte et al. | Sep 2002 | A1 |
20020136381 | Shaffer et al. | Sep 2002 | A1 |
20020143620 | Kraus | Oct 2002 | A1 |
20020147695 | Khedkar et al. | Oct 2002 | A1 |
20020161711 | Sartor et al. | Oct 2002 | A1 |
20020194050 | Nabe et al. | Dec 2002 | A1 |
20030009426 | Ruiz-Sanchez | Jan 2003 | A1 |
20030050882 | Degen et al. | Mar 2003 | A1 |
20030061163 | Durfield | Mar 2003 | A1 |
20030065563 | Elliott et al. | Apr 2003 | A1 |
20030065620 | Gailey et al. | Apr 2003 | A1 |
20030078877 | Beirne et al. | Apr 2003 | A1 |
20030097320 | Gordon | May 2003 | A1 |
20030097329 | Nabe et al. | May 2003 | A1 |
20030115133 | Bian | Jun 2003 | A1 |
20030158751 | Suresh et al. | Aug 2003 | A1 |
20030163363 | Pratte et al. | Aug 2003 | A1 |
20030172002 | Spira et al. | Sep 2003 | A1 |
20030182214 | Taylor | Sep 2003 | A1 |
20030195830 | Merkoulovitch et al. | Oct 2003 | A1 |
20030195859 | Lawrence | Oct 2003 | A1 |
20030212618 | Keyes et al. | Nov 2003 | A1 |
20030217003 | Weinflash et al. | Nov 2003 | A1 |
20030220858 | Lam et al. | Nov 2003 | A1 |
20030225692 | Bosch et al. | Dec 2003 | A1 |
20030229504 | Hollister | Dec 2003 | A1 |
20040030667 | Xu et al. | Feb 2004 | A1 |
20040039686 | Klebanoff | Feb 2004 | A1 |
20040044615 | Xue et al. | Mar 2004 | A1 |
20040044617 | Lu | Mar 2004 | A1 |
20040052357 | Logan et al. | Mar 2004 | A1 |
20040054619 | Watson et al. | Mar 2004 | A1 |
20040064401 | Palaghita et al. | Apr 2004 | A1 |
20040064402 | Dreyer et al. | Apr 2004 | A1 |
20040078323 | Johnston et al. | Apr 2004 | A1 |
20040107132 | Honarvar et al. | Jun 2004 | A1 |
20040111305 | Gavan et al. | Jun 2004 | A1 |
20040111312 | Ingman et al. | Jun 2004 | A1 |
20040111363 | Trench et al. | Jun 2004 | A1 |
20040117235 | Shacham | Jun 2004 | A1 |
20040122730 | Tucciarone et al. | Jun 2004 | A1 |
20040143482 | Tivey et al. | Jul 2004 | A1 |
20040143483 | Tivey et al. | Jul 2004 | A1 |
20040167793 | Masuoka et al. | Aug 2004 | A1 |
20040177030 | Shoham | Sep 2004 | A1 |
20040177046 | Ogram | Sep 2004 | A1 |
20040193535 | Barazesh | Sep 2004 | A1 |
20040199462 | Starrs | Oct 2004 | A1 |
20040205080 | Patel | Oct 2004 | A1 |
20040205157 | Bibelnieks et al. | Oct 2004 | A1 |
20040230448 | Schaich | Nov 2004 | A1 |
20040230527 | Hansen et al. | Nov 2004 | A1 |
20040243518 | Clifton et al. | Dec 2004 | A1 |
20050021476 | Candella et al. | Jan 2005 | A1 |
20050027632 | Zeitoun et al. | Feb 2005 | A1 |
20050027983 | Klawon | Feb 2005 | A1 |
20050038688 | Collins et al. | Feb 2005 | A1 |
20050044036 | Harrington et al. | Feb 2005 | A1 |
20050058262 | Timmins et al. | Mar 2005 | A1 |
20050065809 | Henze | Mar 2005 | A1 |
20050065874 | Lefner et al. | Mar 2005 | A1 |
20050075987 | Pintsov et al. | Apr 2005 | A1 |
20050080821 | Breil et al. | Apr 2005 | A1 |
20050097051 | Madill, Jr. et al. | May 2005 | A1 |
20050102226 | Oppenheimer et al. | May 2005 | A1 |
20050108041 | White | May 2005 | A1 |
20050125350 | Tidwell et al. | Jun 2005 | A1 |
20050130704 | McParland et al. | Jun 2005 | A1 |
20050131760 | Manning et al. | Jun 2005 | A1 |
20050144067 | Farahat et al. | Jun 2005 | A1 |
20050154648 | Strause | Jul 2005 | A1 |
20050154664 | Guy et al. | Jul 2005 | A1 |
20050154665 | Kerr | Jul 2005 | A1 |
20050171859 | Harrington et al. | Aug 2005 | A1 |
20050182774 | Weir et al. | Aug 2005 | A1 |
20050187860 | Peterson et al. | Aug 2005 | A1 |
20050209922 | Hofmeister | Sep 2005 | A1 |
20050222906 | Chen | Oct 2005 | A1 |
20050256809 | Sadri | Nov 2005 | A1 |
20050267812 | Jensen et al. | Dec 2005 | A1 |
20050273442 | Bennett et al. | Dec 2005 | A1 |
20050278246 | Friedman et al. | Dec 2005 | A1 |
20050278542 | Pierson et al. | Dec 2005 | A1 |
20050279824 | Anderson et al. | Dec 2005 | A1 |
20060004731 | Seibel et al. | Jan 2006 | A1 |
20060041464 | Powers et al. | Feb 2006 | A1 |
20060041500 | Diana et al. | Feb 2006 | A1 |
20060059073 | Walzak | Mar 2006 | A1 |
20060059110 | Madhok et al. | Mar 2006 | A1 |
20060064340 | Cook | Mar 2006 | A1 |
20060074986 | Mallalieu et al. | Apr 2006 | A1 |
20060080230 | Freiberg | Apr 2006 | A1 |
20060080263 | Willis et al. | Apr 2006 | A1 |
20060100944 | Reddin et al. | May 2006 | A1 |
20060106668 | Kim et al. | May 2006 | A1 |
20060129422 | Kim et al. | Jun 2006 | A1 |
20060129428 | Wennberg | Jun 2006 | A1 |
20060129481 | Bhatt et al. | Jun 2006 | A1 |
20060131390 | Kim | Jun 2006 | A1 |
20060143695 | Grynberg | Jun 2006 | A1 |
20060161435 | Atef et al. | Jul 2006 | A1 |
20060173776 | Shalley et al. | Aug 2006 | A1 |
20060178971 | Owen et al. | Aug 2006 | A1 |
20060184381 | Rice et al. | Aug 2006 | A1 |
20060184417 | Van der Linden et al. | Aug 2006 | A1 |
20060204051 | Holland, IV | Sep 2006 | A1 |
20060229961 | Lyftogt et al. | Oct 2006 | A1 |
20060239512 | Petrillo | Oct 2006 | A1 |
20060242000 | Giguiere | Oct 2006 | A1 |
20060242046 | Haggerty et al. | Oct 2006 | A1 |
20060253358 | Delgrosso et al. | Nov 2006 | A1 |
20060262929 | Vatanen et al. | Nov 2006 | A1 |
20060265243 | Racho et al. | Nov 2006 | A1 |
20060265259 | Diana et al. | Nov 2006 | A1 |
20060271456 | Romain et al. | Nov 2006 | A1 |
20060271457 | Romain et al. | Nov 2006 | A1 |
20070005508 | Chiang | Jan 2007 | A1 |
20070016522 | Wang | Jan 2007 | A1 |
20070033227 | Gaito et al. | Feb 2007 | A1 |
20070038483 | Wood | Feb 2007 | A1 |
20070038516 | Apple et al. | Feb 2007 | A1 |
20070059442 | Sabeta | Mar 2007 | A1 |
20070067234 | Beech et al. | Mar 2007 | A1 |
20070067297 | Kublickis | Mar 2007 | A1 |
20070072190 | Aggarwal | Mar 2007 | A1 |
20070078985 | Shao et al. | Apr 2007 | A1 |
20070083460 | Bachenheimer | Apr 2007 | A1 |
20070093234 | Willis et al. | Apr 2007 | A1 |
20070094137 | Phillips et al. | Apr 2007 | A1 |
20070106582 | Baker et al. | May 2007 | A1 |
20070112582 | Fenlon | May 2007 | A1 |
20070112667 | Rucker | May 2007 | A1 |
20070118435 | Ran | May 2007 | A1 |
20070150372 | Schoenberg | Jun 2007 | A1 |
20070192248 | West | Aug 2007 | A1 |
20070205266 | Carr et al. | Sep 2007 | A1 |
20070214076 | Robida et al. | Sep 2007 | A1 |
20070220003 | Chern et al. | Sep 2007 | A1 |
20070226093 | Chan et al. | Sep 2007 | A1 |
20070233559 | Golec | Oct 2007 | A1 |
20070233561 | Golec | Oct 2007 | A1 |
20070239721 | Ullman et al. | Oct 2007 | A1 |
20070244807 | Andringa et al. | Oct 2007 | A1 |
20070288355 | Roland et al. | Dec 2007 | A1 |
20070288559 | Parsadayan | Dec 2007 | A1 |
20070299771 | Brody et al. | Dec 2007 | A1 |
20080010687 | Gonen et al. | Jan 2008 | A1 |
20080015887 | Drabek et al. | Jan 2008 | A1 |
20080033869 | Steele et al. | Feb 2008 | A1 |
20080066188 | Kwak | Mar 2008 | A1 |
20080077526 | Arumugam | Mar 2008 | A1 |
20080091535 | Heiser et al. | Apr 2008 | A1 |
20080103800 | Domenikos et al. | May 2008 | A1 |
20080103960 | Sweeney | May 2008 | A1 |
20080103972 | Lanc | May 2008 | A1 |
20080109444 | Williams et al. | May 2008 | A1 |
20080109445 | Williams et al. | May 2008 | A1 |
20080120155 | Pliha | May 2008 | A1 |
20080126233 | Hogan | May 2008 | A1 |
20080147454 | Walker et al. | Jun 2008 | A1 |
20080167883 | Khazaneh | Jul 2008 | A1 |
20080175360 | Schwarz et al. | Jul 2008 | A1 |
20080255992 | Lin | Oct 2008 | A1 |
20080270292 | Ghosh et al. | Oct 2008 | A1 |
20080281737 | Fajardo | Nov 2008 | A1 |
20080281756 | Riise et al. | Nov 2008 | A1 |
20080288361 | Rego et al. | Nov 2008 | A1 |
20080288382 | Smith et al. | Nov 2008 | A1 |
20080294540 | Celka et al. | Nov 2008 | A1 |
20080300962 | Cawston et al. | Dec 2008 | A1 |
20090044279 | Crawford et al. | Feb 2009 | A1 |
20090106150 | Pelegero et al. | Apr 2009 | A1 |
20090106846 | Dupray et al. | Apr 2009 | A1 |
20090125369 | Kloostra et al. | May 2009 | A1 |
20090126013 | Atwood et al. | May 2009 | A1 |
20090144160 | Haggerty et al. | Jun 2009 | A1 |
20090144185 | Haggerty et al. | Jun 2009 | A1 |
20090182653 | Zimiles | Jul 2009 | A1 |
20090199264 | Lang | Aug 2009 | A1 |
20090222308 | Zoldi et al. | Sep 2009 | A1 |
20090222373 | Choudhuri et al. | Sep 2009 | A1 |
20090222374 | Choudhuri et al. | Sep 2009 | A1 |
20090222375 | Choudhuri et al. | Sep 2009 | A1 |
20090222376 | Choudhuri et al. | Sep 2009 | A1 |
20090222377 | Choudhuri et al. | Sep 2009 | A1 |
20090222378 | Choudhuri et al. | Sep 2009 | A1 |
20090222379 | Choudhuri et al. | Sep 2009 | A1 |
20090222380 | Choudhuri et al. | Sep 2009 | A1 |
20090228339 | Wolf | Sep 2009 | A1 |
20090248567 | Haggerty et al. | Oct 2009 | A1 |
20090248568 | Haggerty et al. | Oct 2009 | A1 |
20090248569 | Haggerty et al. | Oct 2009 | A1 |
20090248570 | Haggerty et al. | Oct 2009 | A1 |
20090248571 | Haggerty et al. | Oct 2009 | A1 |
20090248572 | Haggerty et al. | Oct 2009 | A1 |
20090248573 | Haggerty et al. | Oct 2009 | A1 |
20090254476 | Sharma et al. | Oct 2009 | A1 |
20090307104 | Weng | Dec 2009 | A1 |
20100023447 | Mac Innis | Jan 2010 | A1 |
20100043055 | Baumgart | Feb 2010 | A1 |
20100094768 | Miltonberger | Apr 2010 | A1 |
20100100945 | Ozzie et al. | Apr 2010 | A1 |
20100114744 | Gonen | May 2010 | A1 |
20100121767 | Coulter et al. | May 2010 | A1 |
20100130172 | Vendrow et al. | May 2010 | A1 |
20100145836 | Baker et al. | Jun 2010 | A1 |
20100205662 | Ibrahim et al. | Aug 2010 | A1 |
20100229245 | Singhal | Sep 2010 | A1 |
20100250364 | Song et al. | Sep 2010 | A1 |
20110004498 | Readshaw | Jan 2011 | A1 |
20110016042 | Cho et al. | Jan 2011 | A1 |
20110047071 | Choudhuri et al. | Feb 2011 | A1 |
20110093383 | Haggerty et al. | Apr 2011 | A1 |
20110112958 | Haggerty et al. | May 2011 | A1 |
20110137730 | McCarney et al. | Jun 2011 | A1 |
20110238477 | Urbanski | Sep 2011 | A1 |
20120197762 | Steinberg et al. | Aug 2012 | A1 |
20140032259 | LaFever et al. | Jan 2014 | A1 |
Number | Date | Country |
---|---|---|
2 384 087 | Jul 2003 | GB |
2 392 748 | Mar 2004 | GB |
2003-016261 | Jan 2003 | JP |
256569 | Jun 2006 | TW |
WO 9103789 | Mar 1991 | WO |
WO 97023838 | Jul 1997 | WO |
WO 99033012 | Jul 1999 | WO |
WO 99046710 | Sep 1999 | WO |
WO 02027610 | Apr 2002 | WO |
WO 03071388 | Aug 2003 | WO |
WO 2004046882 | Jun 2004 | WO |
WO 2005036859 | Apr 2005 | WO |
WO 2006110873 | Oct 2006 | WO |
WO 2008057853 | May 2008 | WO |
Entry |
---|
Bharadwaj, “Sustainable Competitive Advantage in Service Industries,” Joumal of Marketing; Oct. 1993; 57, 4; pp. 83-99. |
“Anchor Launches LeadVerifier to Verify, Correct and Enhance Internet Leads”, PR Web: Press Release Newswire, Farmingdale, NY, Aug. 8, 2005, p. 2. |
“Impac Funding Introduces Enhanced Website for Static Pool Tracking of MBS Transactions,” Webpage printed out from http://www.lewtan.com/press/1208044_Impac-Lewtan.htm on Mar. 20, 2008. |
“Intelligent Miner Applications Guide”; Chapters 4-7; pp. 33-132; IBM Corp., Apr. 2, 1999. |
“PrimeQ Lead Validation Techniques Gets Stronger”, http://66.102.7.104/search?q=cache:qXAdm0EXcwYJ:www.primeq.com/absolutenm/anmv in 2 pages, Nov. 29, 2005. |
“Why Should You Use LeadVerifier?”, LeadVerifier, https://web.archive.org/web/20051105043240/www.leadverifier.com/LeadVerifier_Why.asp, as archived Nov. 5, 2005, p. 2. |
Authenticom, “What's in a Name?”, downloaded from http://web.archive.org/web/20070708185835/http://www.authenticom.com/story.html, 1 page, Apr. 1, 2009. |
Authenticom, Technical Specs, “Confidence Level Indicators (CLI)”, downloaded from http://www.authenticom.com/confidence_level_indicators.shtml, 2 pages, Aug. 17, 2006. |
Bitran et al., “Mailing Decisions in Catalog Sales Industry”, Management Science (JSTOR), vol. 42, No. 9, pp. 1364-1381, Sep. 1996. |
Caliendo, et al.; “Some Practical Guidance for the Implementation of Propensity Score Matching”; IZA:Discussion Paper Series; No. 1588; Germany; May 2005. |
ChannelWave.com, PRM Central—About PRM, http://web.archive.org/web/20000510214859/http://www.channelwave.com as printed on Jun. 21, 2006, May 2000 Archive. |
Chores & Allowances. “Do Kids Have Credit Reports?”, Oct. 15, 2007, http://choresandallowances.blogspot.com/2007/10/do-kids-have-credit-reports. html. |
Chung, Charles, “Multi-Channel Retailing Requires the Cleanest Data—But Don't Expect it From the Customer”, Internet Retailer, Jan./Feb. 2002, pp. 61-62. |
Cowie, Norman, Warning Bells & “The Bust-Out”, Business Credit, Jul. 1, 2000. |
Dymi, Amilda, Need for Leads Spurs Some Upgrades, Origination News—Special Report, May 1, 2008, vol. vol. 17, Issue No. 8, Pages p. 24, Atlanta, Copyright 2008 SourceMedia, Inc. |
eFunds Corporation, Data & Decisioning, Debit Report, as printed on Apr. 1, 2007, http://www.efunds.com/web/industry-solutions/financial-services/frm-debit-report/htm, 1 page. |
eFunds Introduces QualiFileSM; Deluxe Corporation; Sep. 1999; Milwaukee, WI. |
Erschik, Richard, Sales Leads Can Truly Be Seeds of Sales, The Journal of Business & Industrial Marketing, Summer/Fall 1989, vol. vol. 4, Issue No. 2. |
Fair Isaac Introduces Falcon One System to Combat Fraud, Business Wire, May 5, 2005. |
Fair Isaac Offers New Fraud Tool, National Mortgage News & Source Media, Inc., Jun. 13, 2005. |
FinExtra, Basepoint Analytics Introduces Predictive Technology for Mortgage Fraud, May 10, 2005. |
Gibbs, Adrienne; “Protecting Your Children from Identity Theft,” Nov. 25, 2008, http://www.creditcards.com/credit-card-news/identity-ID-theft-and-kids-children-1282.php. |
Greco, Susan, The Rating Game: Grade you Leads to Clear the Pipe Dreams from you Sales Pipeline, Online Reprint, Jan. 1998, vol. vol. 20, Issue No. 1, Pages p. 93 (1-3). |
Griggs, Robyn, Give us Leads! Give us Leads!, Sales and Marketing Management, Jul. 1997, vol. 149, Issue 7, Pages ABI/Inform Global, p. 66. |
Hennessey, Hubert D., Software Propels the Selling Cycle, Software Magazine, Jun. 1988, vol. 8, Issue 8, Pages ABI/Inform Global p. 57-64. |
ID Theft Assist, “Do You Know Where Your Child's Credit Is?”, Nov. 26, 2007, http://www.idtheftassist.com/pages/story14. |
Industry News, New Technology Identifies Mortgage Fraud: Basepoint Analytics Launches FraudMark, Inman News, Oct. 5, 2005, American Land Title Association. |
International Search Report and Written Opinion for PCT/US/2007/006070, dated Nov. 10, 2008. |
International Search Report and Written Opinion for PCT/US2007/083055, dated Jan. 7, 2009. |
International Search Report and Written Opinion for PCT/US2007/63823, dated Oct. 24, 2007. |
International Search Report and Written Opinion for PCT/US2007/63824, dated Oct. 9, 2007. |
International Search Report and Written Opinion for PCT/US2008/064594, dated Oct. 30, 2008. |
International Search Report and Written Opionion for PCT/US2007/63822, dated Sep. 11, 2007. |
Jacob et al., A Case Study of Checking Account Inquiries and Closures in Chicago, The Center for Financial Services Innovation, Nov. 2006. |
Lamons, Bob; Be Smart: Offer Inquiry Qualification Services, Marketing News, Nov. 6, 1995, vol. 29, No. 23, ABI/Inform Global, p. 13. |
Leadmaster; http://web.archive.org/web/20001206021800/http://leadmaster.com/index.html as printed on Jan. 18, 2006, Dec. 2000. |
LifeLock, “How LifeLock Works,” http://www.lifelock.com/lifelock-for-people, accessed Mar. 14, 2008. |
LifeLock, “LifeLock Launches First ID Theft Prevention Program for the Protection of Children,” Oct. 14, 2005 Press Release, posted on http://www.lifelock.com/about-us/press-room/2005-press-releases/lifelock-protection-for-children. |
LifeLock; “How can LifeLock protect my kids and family?,” http://www.lifelock.com/lifelock-for-people/how-we-do-it/how-can-lifelock-protect-my-kids-and-family, accessed Mar. 14, 2008. |
Loshin, Intelligent Enterprise: Better Insight for Business Decisions, “Value-Added Data: Merge Ahead”, Feb. 9, 2000, vol. 3, No. 3, 5 pages. |
LowerMyBills, Inc., “Lower Your Mortgage with a Lender You Can Trust” http://web.archive.org/web/20071110203156/http://www.lowermybills.com/ dated Nov. 10, 2007 in 11 pages. |
MarketSoft.com, Turning Inquiries into Revenue: Leads are the Key, eLeads MarketSoft http://web.archive.org/web/20000309005815/marketsoft.com.product.index.htm as printed on Jun. 22, 2006, Feb. 2000. |
Otter, et al., “Direct Mail Selection by Joint Modeling of the Probability and Quantity of Response”, Jun. 1997, p. 14. |
Polatoglu et al., “Theory and Methodology, Probability Distributions of Cost, Revenue and Profit over a Warranty Cycle”, European Journal of Operational Research, vol. 108, Issue 1, Jul. 1998, pp. 170-83. |
RAP Interactive, Inc. and Web Decisions: Proudly Presents Live Decisions, A Powerful New Information and Technology Resource that Revolutionizes Interactive Marketing, downloaded from www.webdecisions.com/pdf/LiveDecisions_Bro.pdf, as printed on Aug. 13, 2007, p. 2. |
Real IQ, “Lead Metrix”, downloaded from http://www.realiq.com/leadmetrix.html, 1 page, Aug. 17, 2006. |
Real IQ, “Mortgage Industry”, downloaded from http://www.realiq.com/mortgage.html, 4 pages, Aug. 17, 2006. |
Real IQ, RealIQ.com, retrieved from web.archive.org http://replay.web.archive.org/20051212152337/http://www.realiq.com/mortgage.html as printed on Apr. 28, 2011, 2 pgs. |
SalesLogix.net, SalesLogix Sales Tour, http://web.archive.org/web/20010411115938/www.saleslogix.com/home/index.php3celli . . . as printed on Aug. 30, 2005, Apr. 2000, pp. 19 pages. |
ServiceObjects, “DOTS Web Services—Product Directory”, downloaded from http://www.serviceobjects.com/products/directory_of_web_services.asp, 4 pages, Aug. 17, 2006. |
ServiceObjects, “Real-Time Customer Intelligence for a Nickel”, downloaded from http://www.serviceobjects.com/products/default.asp, 3 pages, Aug. 17, 2006. |
Steele, Georgia, Pipeline Software Tracks Process; Tired of Dealing with Lead Generation Firms, CitiPacific Mortgage has built a tool that will allow Mortgage Originators to Track Leads in an Integrated Sales and Marketing Approach, Broker Magazone, Mar. 2006, vol. vol. 8, Issue Iss. 2, p. 26, New York. |
Stein, Benchmarking Default Prediction Models: Pitfalls and Remedies in Model Validation, Moody's KMV, Revised Jun. 13, 2002, Technical Report #020305; New York. |
Sumner, Anthony, “Tackling the Issue of Bust-Out Fraud”, Retail Banker International, Jul. 24, 2007, p. 4. |
Tao, Lixin; “Shifting Paradigms with the Application Service Provider Model”; Concordia University, Canada; IEEE; Oct. 2001. |
TARGUSinfo: “Intermark Media Slashes Returned Lead Costs, Improves Affiliate Relations,” downloaded from www.targusinfo.com, 2007, p. 4. |
TARGUSinfo: Lead Verification, Verify Your Leads With Unique Accuracy and Ease, downloaded from www.targusinfo.com/solutions/verify/Default.asp, as printed Aug. 1, 2006, p. 1. |
TARGUSinfo: Solutions: Services: Verify Express—Verify, Correct and Enhance Customer Provided Data, http:www.targusinfo.com/solutions/services/verify/ Oct. 28, 2005, 27 pgs. |
The Center for Financial Services Innovation, A Case Study of Checking Account Inquiries and Closures in Chicago, Nov. 2006. |
Thoemmes, Felix; “Propensity Score Matching in SPSS”; Center for Educational Science and Psychology, University of Tübingen; Jan. 2012. |
Truston, “Checking if your child is an ID theft victim can be stressful,” as posted by Michelle Pastor on Jan. 22, 2007 at http://www.mytruston.com/blog/credit/checking_if_your_child_is_an_id_theft_vi.html. |
Vamosi, Robert, “How to Handle ID Fraud's Youngest Victims,” Nov. 21, 2008, http://news.cnet.com/8301-10789_3-10105303-57.html. |
W.A. Lee, American Banker: The Financial Services Daily, Experian, On Deal Hunt, Nets Identity Theft Insurer, Jun. 4, 2003. |
Web Decisions, “Live Decisions”, downloaded from http://www.webdecisions.com, 2 pages, Sep. 18, 2006. |
Number | Date | Country | |
---|---|---|---|
61330285 | Apr 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13073878 | Mar 2011 | US |
Child | 14820231 | US |