Data processing method for maximization of present and future supply and/or demand objectives

• US 8,255,269 B1
• Filed: 10/30/2007
• Issued: 08/28/2012
• Est. Priority Date: 11/11/2006
• Status: Active Grant

• Current Assignee: Samir Aued
• Original Assignee: Samir Aued
• Inventors: Aued, Samir
• Primary Examiner(s): Meinecke Diaz, Susanna M
• Application Number:
  US11/929,996
• Time in Patent Office: 1,764 Days
• Field of Search: 705/7.35
• US Class Current: 705/7.35
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/08 Auctions

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.

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.

2. The processor-implemented method according to claim 1, wherein a probability of the user obtaining the good or service within the given period of time is used in determining the optimal transaction.

3. The processor-implemented method according to claim 2, wherein the probability of each user obtaining the good or service in the given period of time is determined based upon at least one of the following:

information received from the user;

the user'"'"'s prior transaction history;

the user'"'"'s profile background;

a score rate assigned to the user; and

/or webpages that the user has viewed on the user'"'"'s computer.

4. The processor-implemented method according to claim 2, further comprising determining a probability of each supplier supplying the good or service within the given period of time.

5. The processor-implemented method according to claim 4, wherein the probability of the supplier supplying the good or service within the given period of time is used in determining the optimal transaction.

6. The processor-implemented method according to claim 4, wherein the probability of each supplier supplying the good or service in the given period of time is determined based upon at least one of the following:

information received from the supplier;

the supplier'"'"'s prior supply history;

the supplier'"'"'s profile background;

a score rate assigned to the supplier; and

/or webpages that the supplier has viewed on the supplier'"'"'s computer.

7. The processor-implemented method according to claim 1, wherein the method is operated by an administrator, further comprising computing an absolute score rate for each committed user, uncommitted user and supplier, the absolute score rate representing the utility of each committed user, uncommitted user and supplier to the administrator.

8. The processor-implemented method according to claim 7, wherein uncommitted users having higher absolute scores are prioritized for inducement relative to uncommitted users having lower absolute scores.

9. The processor-implemented method according to claim 7, wherein the absolute score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

10. The processor-implemented method of claim 9, wherein the absolute score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

11. The processor-implemented method of claim 10, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

12. The processor-implemented method of claim 9, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

13. The processor-implemented method according to claim 1, further comprising inducing users and suppliers to take certain actions to minimize the difference between the optimal transaction and maximum transaction when the difference exceeds the predefined threshold.

14. The processor-implemented method according to claim 13, further comprising:

recalculating the maximum transaction associated with committed users and suppliers after inducement; and

comparing the optimal transaction to the recalculated maximum transaction to determine the difference between the optimal transaction and recalculated maximum transaction; and

inducing users and suppliers to take action to minimize the difference between the optimal transaction and recalculated maximum transaction when the difference exceeds the predefined threshold.

15. The processor-implemented method according to claim 13, further comprising dissolving the aggregated groups of users and suppliers for the transaction after a predetermined number of attempts to induce users and suppliers to minimize the difference between the optimal and maximum transactions results in the difference exceeding the predefined threshold.

16. The processor-implemented method according to claim 1, further comprising aggregating committed and non-committed suppliers into groups having common characteristics.

17. The processor-implemented method according to claim 1, wherein the groups are aggregated based on predefined aggregation rules.

18. The processor-implemented method according to claim 1, wherein the groups are aggregated based on dynamically generated aggregation rules.

19. The processor-implemented method according to claim 18, further comprising identifying trends associated with data about each user and supplier;

and dynamically generating the aggregation rules based upon the trends determined from the data.

20. The processor-implemented method according to claim 1, wherein the groups are aggregated based on groups proposed by users or suppliers.

21. The processor-implemented method according to claim 1, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the user.

22. The processor-implemented method according to claim 1, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the supplier.

23. The processor-implemented method according to claim 1, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of both the user and supplier.

24. The processor-implemented method according to claim 1, further comprising computing a relative score rate for each committed user, uncommitted user and supplier, the relative score rate representing the utility of each committed user, uncommitted user and supplier relative to another committed user, uncommitted user, supplier or a product.

25. The processor-implemented method according to claim 24, wherein uncommitted users having higher relative score rates relative to a specific supplier or a product being sold by the specific supplier are prioritized for inducement relative to uncommitted users having lower absolute score rates relative to the specific supplier or the product being sold by the specific supplier.

26. The processor-implemented method according to claim 24, wherein the relative score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

27. The processor-implemented method of claim 26, wherein the relative score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

28. The processor-implemented method of claim 27, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

29. The processor-implemented method of claim 26, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

30. The processor-implemented method of claim 1, further comprising suggesting to the uncommitted user or committed user at least one of:

an alternative group transacting the same good or service, a traditional retailer transacting the same good or service, and an on-line retailer transacting the same good or service.

31. The processor-implemented method of claim 1, further comprising aggregating, using a computer-processor, committed users and suppliers into a group based on a complementing user sensitivity of committed users and supplier sensitivity of suppliers.

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.

33. The system according to claim 32, wherein a probability of the user obtaining the good or service within the given period of time is used in determining the optimal transaction.

34. The system according to claim 33, wherein the probability of each user obtaining the good or service in the given period of time is determined based upon at least one of the following:

information received from the user;

the user'"'"'s prior transaction history;

the user'"'"'s profile background;

a score rate assigned to the user; and

/or webpages that the user has viewed on the user'"'"'s computer.

35. The system according to claim 33, further comprising determining a probability of each supplier supplying the good or service within the given period of time.

36. The system according to claim 35, wherein the probability of the supplier supplying the good or service within the given period of time is used in determining the optimal transaction.

37. The system according to claim 35, wherein the probability of each supplier supplying the good or service in the given period of time is determined based upon at least one of the following:

information received from the supplier;

the supplier'"'"'s prior supply history;

the supplier'"'"'s profile background;

a score rate assigned to the supplier; and

/or webpages that the supplier has viewed on the supplier'"'"'s computer.

38. The system according to claim 32, wherein the system is operated by an administrator, further comprising computing an absolute score rate for each committed user, uncommitted user and supplier, the absolute score rate representing the utility of each committed user, uncommitted user and supplier to the administrator.

39. The system according to claim 38 wherein uncommitted users having higher absolute scores are prioritized for inducement relative to uncommitted users having lower absolute scores.

40. The system according to claim 38, wherein the absolute score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

41. The system of claim 40, wherein the absolute score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

42. The system of claim 41, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

43. The system of claim 40, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

44. The system according to claim 38, further comprising identifying trends associated with data about each user and supplier;

and dynamically generating the aggregation rules based upon the trends determined from the data.

45. The system according to claim 32, further comprising inducing users and suppliers to take certain actions to minimize the difference between the optimal transaction and maximum transaction when the difference exceeds the predefined threshold.

46. The system according to claim 45, further comprising:

recalculating the maximum transaction associated with committed users and suppliers after inducement; and

comparing the optimal transaction to the recalculated maximum transaction to determine the difference between the optimal transaction and recalculated maximum transaction; and

inducing users and suppliers to take action to minimize the difference between the optimal transaction and recalculated maximum transaction when the difference exceeds the predefined threshold.

47. The system according to claim 45, further comprising dissolving the aggregated groups of users and suppliers for the transaction after a predetermined number of attempts to induce users and suppliers to minimize the difference between the optimal and maximum transactions results in the difference exceeding the predefined threshold.

48. The system according to claim 32, further comprising aggregating committed and non-committed suppliers into groups having common characteristics.

49. The system according to claim 32, wherein the groups are aggregated based on predefined aggregation rules.

50. The system according to claim 32, wherein the groups are aggregated based on dynamically generated aggregation rules.

51. The system according to claim 32, wherein the groups are aggregated based on groups proposed by users or suppliers.

52. The system according to claim 32, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the user.

53. The system according to claim 32, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the supplier.

54. The system according to claim 32, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of both the user and supplier.

55. The system according to claim 32, further comprising computing a relative score rate for each committed user, uncommitted user and supplier, the relative score rate representing the utility of each committed user, uncommitted user and supplier relative to another committed user, uncommitted user, supplier or a product.

56. The system according to claim 55, wherein uncommitted users having higher relative score rates relative to a specific supplier or a product sold by the specific supplier are prioritized for inducement relative to uncommitted users having lower absolute score rates relative to the specific supplier or the product sold by the specific supplier.

57. The system according to claim 55, wherein the relative score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

58. The system of claim 57, wherein the relative score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

59. The system of claim 58, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

60. The system of claim 57, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

61. The system of claim 60, wherein the relative score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

62. The system of claim 61, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

63. The system according to claim 57, wherein the relative score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

64. The system of claim 63, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

65. The system of claim 32, further comprising suggesting to the uncommitted user or committed user at least one of:

an alternative group transacting the same good or service, a traditional retailer transacting the same good or service, and an on-line retailer transacting the same good or service.

66. The system of claim 32, further comprising aggregating, using a computer-processor, committed users and suppliers into a group based on a complementing user sensitivity of committed users and supplier sensitivity of suppliers.

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.

68. The processor-implemented method according to claim 67, further comprising aggregating committed and non-committed suppliers into groups having common characteristics.

69. The processor-implemented method according to claim 68, wherein the users and suppliers are aggregated into groups based on predefined aggregation rules.

70. The processor-implemented method according to claim 68, wherein the users and suppliers are aggregated into groups based on dynamically generated aggregation rules.

71. The processor-implemented method according to claim 68, wherein the users and/or suppliers are aggregated into groups based on groups proposed by users and/or suppliers.

72. The processor-implemented method according to claim 68, further comprising identifying trends associated with data about each user and supplier;

and dynamically generating the aggregation rules based upon the trends determined from the data.

73. The processor-implemented method according to claim 67, further comprising offering a promotional incentive to one or more non-committed users or suppliers as inducement for a commitment to the transaction.

74. The processor-implemented method according to claim 67, further comprising completing the transaction when the difference between the optimal transaction and maximum transaction is below a predefined threshold.

75. The processor-implemented method according to claim 67, further comprising:

recalculating the maximum transaction associated with committed users and suppliers after inducement; and

comparing the optimal transaction to the recalculated maximum transaction to determine the difference between the optimal transaction and recalculated maximum transaction; and

inducing users and suppliers to take action to minimize the difference between the optimal transaction and recalculated maximum transaction.

76. The processor-implemented method according to claim 75, further comprising dissolving the aggregated groups of users and suppliers for the transaction after a predetermined number of attempts to induce users and suppliers to minimize the difference between the optimal and maximum transactions results in the difference exceeding a predefined threshold.

77. The processor-implemented method according to claim 67, further comprising:

receiving information from a user indicative of conditions upon which the user intends to obtain the good or service within a given period of time; and

determining a probability of the user obtaining the good or service within the given period of time.

78. The processor-implemented method according to claim 77, wherein the probability of the user obtaining the good or service within the given period of time is used in determining the optimal transaction.

79. The processor-implemented method according to claim 77, wherein the probability of each user obtaining the good or service in a given period of time is determined based upon at least one of the following:

information received from the user;

the user'"'"'s prior transaction history;

the user'"'"'s profile background;

a score rate assigned to the user; and

/or webpages that the user has viewed on the user'"'"'s computer.

80. The processor-implemented method according to claim 67, further comprising:

receiving information from a supplier indicative of the conditions upon which the supplier intends to supply the good or service within a given period of time; and

determining a probability of the supplier supplying the good or service within the given period of time.

81. The processor-implemented method according to claim 80, wherein the probability of the supplier supplying the good or service within the given period of time is used in determining the optimal transaction.

82. The processor-implemented method according to claim 80, wherein the probability of each supplier supplying the good or service in the given period of time is determined based upon at least one of the following:

information received from the supplier;

the supplier'"'"'s prior supply history;

the supplier'"'"'s profile background;

a score rate assigned to the supplier; and

/or webpages that the supplier has viewed on the supplier'"'"'s computer.

83. The processor-implemented method according to claim 67, wherein the method is operated by an administrator, further comprising computing an absolute score rate for each committed user, uncommitted user and supplier, the absolute score rate representing the utility of each committed user, uncommitted user and supplier to the administrator.

84. The processor-implemented method according to claim 83, wherein uncommitted users having higher absolute scores are prioritized for inducement relative to uncommitted users having lower absolute scores.

85. The processor-implemented method according to claim 83, wherein the absolute score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

86. The processor-implemented method of claim 85, wherein the absolute score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

87. The processor-implemented method of claim 86, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

88. The processor-implemented method of claim 85, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

89. The processor-implemented method according to claim 67, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the user.

90. The processor-implemented method according to claim 67, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the supplier.

91. The processor-implemented method according to claim 67, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of both the user and supplier.

92. The processor-implemented method according to claim 67, further comprising computing a relative score rate for each committed user, uncommitted user and supplier, the relative score rate representing the utility of each committed user, uncommitted user and supplier relative to another committed user, uncommitted user, supplier or a product.

93. The processor-implemented method according to claim 92, wherein uncommitted users having higher relative score rates relative to a specific supplier or a product sold by the specific supplier are prioritized for inducement relative to uncommitted users having lower absolute score rates relative to the specific supplier or the product sold by the specific supplier.

94. The processor-implemented method according to claim 92, wherein the relative score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

95. The processor-implemented method of claim 94, wherein the relative score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

96. The processor-implemented method of claim 95, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

97. The processor-implemented method of claim 94, wherein the relative score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

98. The processor-implemented method of claim 67, further comprising suggesting to the uncommitted user or committed user at least one of:

an alternative group transacting the same good or service, a traditional retailer transacting the same good or service, and an on-line retailer transacting the same good or service.

99. The processor-implemented method of claim 67, further comprising aggregating, using a computer-processor, committed users and suppliers into a group based on a complementing user sensitivity of committed users and supplier sensitivity of suppliers.

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.

101. The system according to claim 100, further comprising aggregating committed and non-committed suppliers into groups having common characteristics.

102. The system according to claim 101, wherein the users and suppliers are aggregated into groups based on predefined aggregation rules.

103. The system according to claim 101, wherein the users and suppliers are aggregated into groups based on dynamically generated aggregation rules.

104. The system according to claim 103, further comprising identifying trends associated with data about each user and supplier;

and dynamically generating the aggregation rules based upon the trends determined from the data.

105. The system according to claim 101, wherein the users and/or suppliers are aggregated into groups based on groups proposed by users and/or suppliers.

106. The system according to claim 101, wherein the system is operated by an administrator, further comprising computing an absolute score rate for each committed user, uncommitted user and supplier, the absolute score rate representing the utility of each committed user, uncommitted user and supplier to the administrator.

107. The system according to claim 106, wherein uncommitted users having higher absolute scores are prioritized for inducement relative to uncommitted users having lower absolute scores.

108. The system according to claim 106, wherein the absolute score rate is computed for each committed user, uncommitted user and supplier based on at least a future transaction intent.

109. The system of claim 108, wherein the absolute score rate is computed for each committed user, uncommitted user and committed seller further based on at least one of the following:

a commitment status to at least one transaction, a referral inducting a new user, a previous transaction history, a frequency of conducting transactions, an accuracy of future transaction intent considered in light of transactions actually executed, an evaluation report submitted by other users.

110. The system of claim 109, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

111. The system of claim 108, wherein the absolute score for a particular committed user or uncommitted user must pass a minimum score threshold to be considered for inclusion in the group.

112. The system according to claim 100, further comprising offering a promotional incentive to one or more non-committed users or suppliers as inducement for a commitment to the transaction.

113. The system according to claim 100, further comprising completing the transaction when the difference between the optimal transaction and maximum transaction is below a predefined threshold.

114. The system according to claim 100, further comprising:

recalculating the maximum transaction associated with committed users and suppliers after inducement; and

comparing the optimal transaction to the recalculated maximum transaction to determine the difference between the optimal transaction and recalculated maximum transaction; and

inducing users and suppliers to take action to minimize the difference between the optimal transaction and recalculated maximum transaction.

115. The system according to claim 114, further comprising dissolving the aggregated groups of users and suppliers for the transaction after a predetermined number of attempts to induce users and suppliers to minimize the difference between the optimal and maximum transactions results in the difference exceeding a predefined threshold.

116. The system according to claim 100, further comprising:

receiving information from a user indicative of conditions upon which the user intends to purchase the good or service within a given period of time; and

determining a probability of the user obtaining the good or service within the given period of time.

117. The system according to claim 116, wherein the probability of the user obtaining the good or service within the given period of time is used in determining the optimal transaction.

118. The system according to claim 116, wherein the probability of each user obtaining the good or service in a given period of time is determined based upon at least one of the following:

the information received from the user;

the user'"'"'s prior transaction history;

the user'"'"'s profile background;

a score rate assigned to the user; and

/or webpages that the user has viewed on the user'"'"'s computer.

119. The system according to claim 100, further comprising:

receiving information from a supplier indicative of the conditions upon which the supplier intends to supply the good or service within a given period of time; and

determining a probability of the supplier supplying the good or service within the given period of time.

120. The system according to claim 119, wherein the probability of the supplier supplying the good or service within the given period of time is used in determining the optimal transaction.

121. The system according to claim 119, wherein the probability of each supplier supplying the good or service in the given period of time is determined based upon at least one of the following:

information received from the supplier;

the supplier'"'"'s prior supply history;

the supplier'"'"'s profile background;

a score rate assigned to the supplier; and

/or webpages that the supplier has viewed on the supplier'"'"'s computer.

122. The system according to claim 100, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the user.

123. The system according to claim 100, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of the supplier.

124. The system according to claim 100, wherein the economic goal of the optimal transaction is determined to maximize objectives and constraints of both the user and supplier.

125. The system according to claim 100, further comprising computing a relative score rate for each committed user, uncommitted user and supplier, the relative score rate representing the utility of each committed user, uncommitted user and supplier relative to another committed user, uncommitted user, supplier or a product.

126. The system according to claim 125, wherein uncommitted users having higher relative score rates relative to a specific supplier or a product sold by the specific supplier are prioritized for inducement relative to uncommitted users having lower absolute score rates relative to the specific supplier or the product sold by the specific supplier.

127. The system of claim 100, further comprising suggesting to the uncommitted user or committed user at least one of:

an alternative group transacting the same good or service, a traditional retailer transacting the same good or service, and an on-line retailer transacting the same good or service.

128. The system of claim 100, further comprising aggregating, using a computer-processor, committed users and suppliers into a group based on a complementing user sensitivity of committed users and supplier sensitivity of suppliers.