Patent No. US10237420 (titled "Method and system for matching entities in an auction") on Dec 28, 2017. The application was issued on Mar 19, 2019.
’420 is related to the field of computer-integrated telecommunications and automated resource allocation. Specifically, it addresses the technical challenges of managing real-time communication environments, such as call centers, where incoming requests must be efficiently matched with available human agents or automated resources. The background context involves moving beyond simple first-in-first-out (FIFO) queues or static rule-based routing toward systems that can handle complex, multi-dimensional variables in high-latency environments.
The underlying idea behind ’420 is to integrate high-level intelligent decision-making directly into the low-level switching architecture to perform real-time multivariate optimization. Rather than relying on rigid scripts or external databases that introduce delay, the system treats every potential match as a dynamic economic problem. By modeling the interaction using advanced statistical tools, the invention seeks to maximize the 'economic surplus' of a match while simultaneously accounting for the opportunity cost of making a specific resource unavailable for other potential requests.
The claims of ’420 focus on a method and system for pairing requests with partners by evaluating a plurality of potential matches through a probabilistic predictive evaluator. The independent claims specifically protect the use of automated processors to run complex algorithms—such as Bayesian logic, hierarchical Markov models, or neural networks—that analyze content-specific or requestor-specific characteristics against partner-specific traits. This evaluation results in a control signal that dictates the optimal allocation of resources based on these predictive rankings.
In practice, the invention functions by assigning characteristic vectors to both the incoming request (e.g., caller intent, language, or emotional state) and the available partners (e.g., agent proficiency, cost, or training needs). The system performs a combinatorial analysis to determine the best possible pairing across the entire pool of active requests and available agents. This allows the system to deviate from standard routing if a specific pairing is predicted to yield a higher long-term value, such as using a call as a targeted training opportunity for a trainee while a mentor shadows the session.
This approach differs from prior solutions by shifting the intelligence from external, high-level Customer Relationship Management (CRM) systems down to the telephony server level. Traditional systems often suffer from communication latencies between the switch and the decision-making logic; ’420 eliminates this bottleneck by embedding the optimization within the consolidated platform. Furthermore, unlike static skill-based routing, this invention adaptively updates agent profiles in real-time and considers non-economic factors that change over time, ensuring the system remains efficient even as call volumes and agent capabilities fluctuate.
In the early 2000s when ’420 was filed, computer-integrated telephony was typically implemented using a rigid architectural split where low-level voice processing hardware handled real-time switching while high-level policy management was externalized to separate general-purpose servers. At a time when systems commonly relied on static rule-based routing or manual database lookups to direct calls, the integration of complex decision-making logic directly into the switching layer was non-trivial due to the processing latencies of non-deterministic operating systems. Consequently, standard engineering constraints necessitated that intelligent functions, such as workforce management and skill-based optimizations, remain decoupled from the underlying circuit-switching infrastructure to avoid impairing real-time communication performance.
The invention addresses the technical problem of communication and processing latencies inherent in distributed computer-telephony integration by consolidating intelligent routing algorithms directly within the low-level switching architecture. This architectural shift moves the evaluation of complex, multi-variable cost functions—incorporating agent skill metrics, training objectives, and economic outcomes—from external management systems to the primary telephony server. The technical effect achieved is a reduction in required communication bandwidth and the elimination of non-deterministic delays during call resolution. By integrating real-time inferential targeting and adaptive skill-based routing into the switching process, the system enables a more responsive and globally optimized allocation of resources that accounts for both immediate operational efficiency and long-term agent development.
This patent includes a total of 20 claims, with claims 1, 19, and 20 serving as the independent claims. These independent claims focus on methods and systems for pairing requests with available partners or resources by estimating requestor characteristics and using automated processors to evaluate potential pairings through probabilistic functions, Markov models, or neural networks to generate a control signal. The dependent claims serve to further define the evaluation process by incorporating economic functions, auction mechanisms, specific clustering algorithms, and various statistical models, while also specifying applications such as voice call routing and transaction optimization.
Definitions of key terms used in the patent claims.
US Latest litigation cases involving this patent.

The dossier documents provide a comprehensive record of the patent's prosecution history - including filings, correspondence, and decisions made by patent offices - and are crucial for understanding the patent's legal journey and any challenges it may have faced during examination.
Get instant alerts for new documents