Data processing method for maximization of present and future supply and/or demand objectives
First Claim
1. A processor-implemented method for optimizing a transaction between one or more users of a good or service and one or more suppliers of the good or service, comprising:
- providing a computer-processor; and
storing in computer memory program instructions, wherein the program instructions, when executed, caused the computer-processor to perform the steps of;
receiving, using a computer-processor, information defining a user, the user being a committed user or an uncommitted user;
receiving, a computer-processor, a set of committed purchase conditions from the committed user indicative of conditions upon which the committed user commits to purchasing the good or service within a given period of time;
receiving, using a computer-processor, a set of uncommitted purchase conditions from the uncommitted user indicative of conditions upon which the uncommitted user prefers to purchase the good or service within the given period of time;
receiving, using a computer-processor, committed selling conditions from a supplier indicative of conditions upon which the supplier commits to sell the good or service within the given period of time;
aggregating, using a computer-processor, committed users and suppliers into a group based on complementing committed purchase conditions of committed users and committed selling conditions of suppliers;
determining, using a computer-processor, an optimal transaction based on realization of an economic goal constrained by the committed purchase conditions and committed selling conditions of the group;
determining, using a computer-processor, at least one maximum transaction based on selecting uncommitted users for inducement into the group, based on a threshold similarity of uncommitted purchase conditions of the uncommitted users to be selected and the committed selling conditions, the maximum transaction being a closest possible realization of the optimal transaction;
inducing the selected uncommitted users to join the group as committed users with incentives to create the maximum transaction;
comparing, using a computer-processor, the optimal transaction to the maximum transaction to determine the difference between the optimal transaction and maximum transaction; and
completing the transaction when the difference between the optimal transaction and maximum transaction is below a predefined threshold.
0 Assignments
0 Petitions
Accused Products
Abstract
A processor-implemented system and method for optimizing a transaction between one or more users of a good or service and one or more suppliers of the good or service is disclosed herein. Information is received from a user indicative of conditions upon which the user intends to obtain the good or service within a given period of time. Information is received from a supplier indicative of conditions upon which the supplier intends to supply the good or service within a given period of time. The probability of the user obtaining the good or service within the given period of time is determined, and committed and non-committed users are aggregated into groups having common characteristics. An optimal transaction and a maximum transaction are determined based on information received from the users and suppliers. The optimal transaction is compared to the maximum transaction to determine the difference between the optimal transaction and maximum transaction, and the transaction is completed when the difference between the optimal transaction and maximum transaction is below a predefined threshold.
-
Citations
128 Claims
-
1. A processor-implemented method for optimizing a transaction between one or more users of a good or service and one or more suppliers of the good or service, comprising:
-
providing a computer-processor; and storing in computer memory program instructions, wherein the program instructions, when executed, caused the computer-processor to perform the steps of; receiving, using a computer-processor, information defining a user, the user being a committed user or an uncommitted user; receiving, a computer-processor, a set of committed purchase conditions from the committed user indicative of conditions upon which the committed user commits to purchasing the good or service within a given period of time; receiving, using a computer-processor, a set of uncommitted purchase conditions from the uncommitted user indicative of conditions upon which the uncommitted user prefers to purchase the good or service within the given period of time; receiving, using a computer-processor, committed selling conditions from a supplier indicative of conditions upon which the supplier commits to sell the good or service within the given period of time; aggregating, using a computer-processor, committed users and suppliers into a group based on complementing committed purchase conditions of committed users and committed selling conditions of suppliers; determining, using a computer-processor, an optimal transaction based on realization of an economic goal constrained by the committed purchase conditions and committed selling conditions of the group; determining, using a computer-processor, at least one maximum transaction based on selecting uncommitted users for inducement into the group, based on a threshold similarity of uncommitted purchase conditions of the uncommitted users to be selected and the committed selling conditions, the maximum transaction being a closest possible realization of the optimal transaction; inducing the selected uncommitted users to join the group as committed users with incentives to create the maximum transaction; comparing, using a computer-processor, the optimal transaction to the maximum transaction to determine the difference between the optimal transaction and maximum transaction; and completing the transaction when the difference between the optimal transaction and maximum transaction is below a predefined threshold. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31)
-
-
32. A system for optimizing a transaction between one or more users of a good or service and one or more suppliers of the good or service, comprising:
-
a processor; a memory in communication with the processor and containing program instructions; an input and output in communication with the processor and memory; wherein the process executes program instructions contained in the memory and the program instructions comprise; receiving information defining a user, the user being a committed user or an uncommitted user; receiving a set of committed purchase conditions from the committed user indicative of conditions upon which the committed user commits to purchasing the good or service within a given period of time; receiving committed selling conditions from a supplier indicative of conditions upon which the supplier commits to sell the good or service within the given period of time; aggregating committed users and suppliers into a group based on complementing committed purchase conditions of committed users and committed selling conditions of suppliers; determining an optimal transaction based on realization of an economic goal constrained by the committed purchase conditions and committed selling conditions of the group; determining at least one maximum transaction based on selecting uncommitted users for inducement into the group, based on a threshold similarity of uncommitted purchase conditions of the uncommitted users to be selected and the committed selling conditions, the maximum transaction being a closest possible realization of the optimal transaction; inducing the selected uncommitted users to join the group as committed users with incentives to create the maximum transaction; comparing the optimal transaction to the maximum transaction to determine the difference between the optimal transaction and maximum transaction; and completing the transaction when the difference between the optimal transaction and maximum transaction is below a predefined threshold. - View Dependent Claims (33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66)
-
-
67. A processor-implemented method for optimizing a transaction between one or more users of a good or service and one or more suppliers of the good or service, comprising:
-
providing a computer-processor; and storing, using a computer-processor, in computer memory program instructions, wherein the program instructions, when executed, cause the computer-processor to perform the steps of; aggregating, using a computer-processor, committed users and suppliers into a transaction group based on complementing committed purchase conditions of committed users and committed selling conditions of suppliers; determining, using a computer-processor, an optimal transaction based on realization of an economic goal constrained by the committed purchase conditions and committed selling conditions of the group; determining, using a computer-processor, at least one maximum transaction based on selecting uncommitted users for inducement into the transaction group based on a threshold similarity of uncommitted purchase conditions of the uncommitted users to be selected and the committed selling conditions, the maximum transaction being a closest possible realization of the optimal transaction; inducing the selected uncommitted users to join the transaction group as committed users with incentives to create the maximum transaction; comparing, using a computer-processor the optimal transaction to the maximum transaction to determine the difference between the optimal transaction and maximum transaction; inducing users and suppliers to take certain actions to minimize the difference between the optimal transaction and maximum transaction, and completing the transaction when the difference between the optimal transaction and maximum transaction is below a predefined threshold. - View Dependent Claims (68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99)
-
-
100. A system for optimizing a transaction between one or more users of a good or service and one or more suppliers of the good or service, comprising:
-
a processor; a memory in communication with the processor and containing program instructions; an input and output in communication with the processor and memory; wherein the process executes program instructions contained in the memory and the program instructions comprise; aggregating committed users and suppliers into a group based on complementing committed purchase conditions of committed users and committed selling conditions of suppliers; determining an optimal transaction based realization of an economic goal constrained by the committed purchase conditions and committed selling conditions of the group; determining at least one maximum transaction based on selecting uncommitted users for inducement into the transaction group, based on a threshold similarity of uncommitted purchase conditions of the uncommitted users to be selected and the committed selling conditions, the maximum transaction being a closest possible realization of the optimal transaction; inducing the selected uncommitted users to join the transaction group as committed users with incentives to create the maximum transaction; comparing the optimal transaction to the maximum transaction to determine the difference between the optimal transaction and maximum transaction; inducing users and suppliers to take certain actions to minimize the difference between the optimal transaction and maximum transaction, and completing the transaction when the difference between the optimal transaction and maximum transaction is below a predefined threshold. - View Dependent Claims (101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128)
-
Specification