To All PostsPatent Armory Inc. v. Independent Health Association, Inc. Patents
Case Filing Date: 2025-08-01
| Patent Number | Organic/Acquired | Forward Citation Count | Age Of Patent From Priority Date | Independent Claim Count | Claim 1 Word Count | Family Size | Patent Quality Score |
|---|---|---|---|---|---|---|---|
| US10,237,420 | Organic | 7 | 22 years, 5 months | 3 | 121 | 4 | 68 |
| US10,491,748 | Organic | 11 | 19 years, 4 months | 3 | 179 | 4 | 67 |
| US7,023,979 | Organic | 664 | 23 years, 5 months | 4 | 114 | 2 | 73 |
| US7,269,253 | Organic | 107 | 23 years, 5 months | 3 | 76 | 2 | 68 |
| US9,456,086 | Organic | 20 | 22 years, 5 months | 3 | 133 | 4 | 68 |
| Patent Summary | Independent Claim |
|---|---|
| US10,237,420 - Method and system for matching entities in an auction Automated optimization for pairing entities in auctions enhances economic surplus and minimizes opportunity costs. The method uses inferential targeting parameters and characteristic data for precise matching. Benefits include efficient resource allocation and improved decision-making in competitive environments. | 1. A method of pairing requests, comprising: estimating at least one content-specific or requestor-specific characteristic associated with a request; determining a set of available partners, each having at least one respective partner characteristic; evaluating, with at least one automated processor, a plurality of pairings of the request with a plurality of different available partners, according to an evaluator for valuing pairings of the request with respective available partners, comprising at least one of a probabilistic function, a hierarchical Markov model, Bayesian logic, and a neural network, dependent on the at least one content-specific or requestor-specific characteristic, and the at least one respective partner characteristic; and generating a control signal, by the at least one automated processor, selectively dependent on the evaluating. |
| US10,491,748 - Intelligent communication routing system and method Dynamic communication routing maximizes aggregate utility by associating communications with resources based on economic value. The system uses quantitative capacity and availability states for scoring and optimization. Benefits include efficient resource utilization and enhanced communication outcomes. | 1. A system for assigning communications, comprising a processor and a memory, configured to associate respective communications with respective resources, wherein the memory has stored therein instructions that, when executed by the processor, cause the processor to: receive a plurality of respective communications; identify a plurality of resources available for association with a respective communication and capable of handling the respective communication, each available resource having a limited quantitative capacity for association with multiple communications, and an availability state; calculate a respective score associated with each available resource dependent on the availability state of a respective available resource; estimate an expected economic value to be obtained by associating each respective communication with each respective available resource, dependent on at least the score and a respective communication-content dependent value function of an outcome of a respective communication associated with a respective available resource; and assign each of the plurality of respective communications to one of the plurality of resources based on at least the estimated expected economic value to be obtained by associating each respective communication with each respective resource. |
| US7,023,979 - Telephony control system with intelligent call routing Optimized agent selection for call routing uses multivariate cost functions to match calls with agents. The system integrates classification data and agent characteristics for precise routing. Benefits include improved customer service and operational efficiency. | 1. A communications control system, having a common operating environment, comprising: (a) an input for receiving call classification information; (b) a data structure representing agent characteristics; and (c) a processor, for (a) determining, with respect to the received call classification information, an optimum agent for association with a call corresponding to call classification information, based on a multivariate cost function comparing at least three agents, the selection being based on at least a correspondence of said call classification and said data structure of agent characteristics, and (b) controlling a call routing of the call in dependence on the determination, said determining and routing functions of said processor being performed within the common operating environment. |
| US7,269,253 - Telephony control system with intelligent call routing Combinatorial optimization for call routing determines the best target for communications based on classification and target characteristics. The system uses cost-benefit analysis and predicted availability for decision-making. Benefits include efficient communication handling and reduced operational costs. | 1. A communications control system comprising: (a) an input for receiving information representing a plurality of characteristics of a respective communication; (b) a data structure representing characteristics of at least three potential communication targets; and (c) a processor, for determining a target for a respective communication, based on a combinatorial optimization of available targets, said processor analyzing said received information and said data structure, and outputting the determined available target for association with the respective communication. |
| US9,456,086 - Method and system for matching entities in an auction Automated optimization for matching entities in auctions enhances economic surplus and minimizes opportunity costs. The method uses inferential targeting parameters and characteristic data for precise matching. Benefits include efficient resource allocation and improved decision-making in competitive environments. | 1. A method for matching a first subset selected from a plurality of first entities with a second subset selected from a plurality of second entities, comprising: storing in a memory a plurality of multivalued scalar data representing inferential targeting parameters for the first subset; storing in the memory a plurality of multivalued scalar data of each of the plurality of second entities, representing respective characteristic parameters for each respective second entity; performing, using an automated processor, an optimization with respect to at least an economic surplus of a respective mutually exclusive match of the first subset with the second subset, and an opportunity cost of the unavailability of the second subset for matching with an alternate subset of the plurality of first entities; and outputting a signal in dependence on the optimization. |
