Article trading among members of a community

• US 8,521,611 B2
• Filed: 03/06/2007
• Issued: 08/27/2013
• Est. Priority Date: 03/06/2006
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Nguyen, Vu, Baird-Smith, Anselm P., Alvarado, William A., Cogan, John P., Alvarado, Carole K.
• Primary Examiner(s): LEVINE, ADAM L
• Application Number:
  US11/682,635
• Publication Number:
  US 20070244768A1
• Time in Patent Office: 2,366 Days
• Field of Search: 705/4, 705/37, 705/41, 705 26- 272
• US Class Current: 705/26.4
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: G06Q 30/0605 Supply or demand aggregation
• CPC Class Codes: G06Q 30/0625 Directed, with specific intent or strategy
• CPC Class Codes: G06Q 30/0629 for generating comparisons
• CPC Class Codes: G06Q 30/0635 Processing of requisition or of purchase orders
• CPC Class Codes: G06Q 30/0641 Shopping interfaces
• CPC Class Codes: G06Q 30/08 Auctions

Abstract

Articles such as compact discs or electronic files are traded among a plurality of members who are registered in a common community. Each member has an account including a trading credit balance and a mailing address. A user interface is provided that allows a member to enter articles that the member owns and is willing to trade and articles that the member wants to own. The user interface also receives article trading instruction messages. An administration computer hosts the plurality of members and facilitates article trades among the members. The administration computer identifies matches between owned and wanted articles. A priority algorithm is used to select the member who will receive the article if there is more than one member who wants an article that another member owns and is willing to trade. The priority algorithm is based in part on a member score that is a function of the relative value of the articles that a member owns and sends to another member compared to the relative value of the articles that the member wants and receives from another member, the relative value of the articles being determined by a demand for the article compared to a supply for the article among the members.

Claims

1. A computer-implemented method of trading articles among a plurality of members who are registered in a common community, the method comprising:

(a) providing a user interface that allows a member to;

(i) enter articles that the member owns and is willing to trade, and

(ii) enter articles that the member wants to own,

(b) communicating items (i) and (ii) to and from an administration computer associated with the common community via an electronic network; and

(c) the administration computer hosting the plurality of members and facilitating article trades among the members via the administration computer and the electronic network, the administration computer;

(i) identifying matches between owned and wanted articles,

(ii) associating each member of the plurality of members with a risk assessment score that is a function of a number of trades executed by the respective member and a ratio of good trades to total trades,

(iii) associating each member of the plurality of members with a trading credit balance that reflects a difference between a number of articles that the member previously owned and traded to other members and a number of articles that were sent to the member by other members, the trading credit balance being used to generate a trading credit balance number for the member by weighting the trading credit balance based on the risk assessment score associated with the member, and

(iv) using a priority algorithm to select one of at least two of the plurality of members who each entered the same article that they want to own to yield a receiving member who will receive the article, the priority algorithm configured for computing priority scores for each of the at least two members based on a plurality of factors, the plurality of factors comprising at least the total number of articles that the member has traded and the trading credit balance number, and selecting the receiving member based on a highest of the priority scores.

2. The method of claim 1 wherein each member has a mailing address, and the priority algorithm uses a distance between mailing addresses of members associated with the identified matches as one of the factors in the priority algorithm.

3. The method of claim 1 wherein the administration computer in step (c) further:

(v) maintains records of the amount of time since each member last received an article, and the priority algorithm uses the amount of time as one of the factors in the priority algorithm to select the receiving member who will receive the article.

4. The method of claim 1 wherein each article has a supply/demand score which is a function of the supply of an article to the demand for an article, the administration computer further:

(v) comparing a supply/demand score for each article that a member ships at the time that the member ships the article to an average supply/demand score for all articles at the time that the member ships the article to obtain a supply/demand score ratio, and

(vi) calculating a running average of the supply/demand score ratio for each member,

wherein the supply/demand score is used as one of the factors in the priority algorithm to select the receiving member.

5. The method of claim 1 wherein the article trades are one-way article trades.

6. The method of claim 1 wherein the articles include music recordings stored on a computer-readable medium.

7. The method of claim 1 wherein the articles are compact discs.

8. The method of claim 1 wherein the articles are all of the same type.

9. The method of claim 1, further comprising:

(d) crediting an amount from a trading credit balance associated with the trading member and deducting an amount from a trading credit balance associated with the receiving member.

10. The method of claim 1, wherein the priority algorithm prohibits members having a trading credit balance less than a predetermined value from being selected as the receiving member.

11. The method of claim 1, wherein the priority algorithm prohibits members having a predetermined number of trades initiated but not yet completed from being selected as the receiving member.

12. The method of claim 1, wherein each member is associated with a quality balance score and each of the articles is associated with a quality article score, the quality balance score being the sum of the articles previously sent by the member and with the quality article score greater than the quality article score of the article that the member currently wants to receive minus the sum of the articles previously received by the member and with the quality article score greater than the quality article score of the article that the member wants to receive, the quality article score being a function of the current demand for the article to the current supply of the article among the members, and wherein the priority algorithm uses at least the quality balance score as one of the factors in the priority algorithm.

13. The method of claim 1, wherein the user interface further allows a member to view articles that other members are willing to trade and view articles that other members want to own.

14. A system for facilitating the trading of articles among a plurality of members, the system comprising:

a processor;

a module configured to control the processor to provide a user interface that allows a member to;

(i) enter articles that the member owns and is willing to trade, and

(ii) enter articles that the member wants to own,

a module configured to control the processor to identify matches between owned and wanted articles,

a module configured to associate each member of the plurality of members with a risk assessment score that is a function of a number of trades executed by the respective member and a ratio of good trades to total trades,

a module configured to associate each member of the plurality of members with a trading credit balance that reflects a difference between a number of articles that the member previously owned and traded to other members and a number of articles that were sent to the member by other members, the trading credit balance being used to generate a trading credit balance number for the member by weighting the trading credit balance based on the risk assessment score associated with the member, and

a module configured to control the processor to select a receiving member who will receive the article among at least two members who want the article that a trading member owns and is willing to trade, the selection based on a priority algorithm to prioritize the at least two members wanting the article, the priority algorithm configured for computing priority scores for each of the at least two members based on a plurality of factors, the plurality of factors comprising at least the total number of articles that the member has traded and the trading credit balance number, and selecting the receiving member based on a highest of the priority scores.

15. The system of claim 14, further comprising:

a module configured to control the processor to credit an amount to a trading credit balance associated with the trading member and deduct an amount from a trading credit balance associated with the receiving member.

16. The system of claim 14, wherein the priority algorithm prohibits members having a trading credit balance less than a predetermined value from being selected as the receiving member.

17. The system of claim 14, wherein the priority algorithm prohibits members having a predetermined number of trades initiated but not yet completed from being selected as the receiving member.

18. The system of claim 14, wherein each member is associated with a quality balance score and each of the articles is associated with a quality article score, the quality balance score being the sum of the articles previously sent by the member and with the quality article score greater than the quality article score of the article that the member currently wants to receive minus the sum of the articles previously received by the member and with the quality article score greater than the quality article score of the article that the member wants to receive, the quality article score being a function of the current demand for the article to the current supply of the article among the members, and wherein the priority algorithm uses at least the quality balance score as one of the factors in the priority algorithm.

19. The system of claim 14, wherein the user interface further allows a member to view articles that other members are willing to trade and view articles that other members want to own.

20. The system of claim 14, wherein each member has a mailing address, and the priority algorithm uses a distance between mailing addresses of identified matching members as one of the factors in the priority algorithm.

21. The system of claim 14, further comprising:

a module configured to control the processor to calculate the amount of time since a member last received an article, wherein the priority algorithm uses the calculated amount of time as one of the factors.

22. The system of claim 14, comprising:

a module configured to control the processor to calculate a supply a supply/demand score for each article, the supply/demand score being a function of the supply of an article to the demand for an article;

a module configured to control the processor to calculate a supply/demand score ratio for each member, the supply/demand score ratio being a function of the supply/demand score for each article that a member ships at the time that the member ships the article to an average supply/demand score for all articles at the time that the member ships; and

a module configured to control the processor to calculate a running average of the supply/demand score ratio for each member,

wherein the supply/demand score is used as one of the factors in the priority algorithm.

23. The system of claim 14, wherein the article trades are one-way article trades.

24. A non-transitory computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to facilitate the trading of articles among a plurality of members, the instructions comprising:

providing a user interface that allows a member to;

(i) enter articles that the member owns and is willing to trade, and

(ii) enter articles that the member wants to own,

identifying matches between owned and wanted articles,

associating each member of the plurality of members with a risk assessment score that is a function of a number of trades executed by the respective member and a ratio of good trades to total trades,

associating each member of the plurality of members with a trading credit balance that reflects a difference between a number of articles that the member previously owned and traded to other members and a number of articles that were sent to the member by other members, the trading credit balance being used to generate a trading credit balance number for the member by weighting the trading credit balance based on the risk assessment score associated with the member, and

selecting one among at least two members who want an article a trading member owns and is willing to trade to yield a receiving member, the selection using a priority algorithm to prioritize the at least two members wanting the article, the priority algorithm configured for computing priority scores for each of the at least two members based on a plurality of factors, the plurality of factors comprising at least the total number of articles that the member has traded and the trading credit balance number, and selecting the receiving member based on a highest of the priority scores.

25. The non-transitory computer-readable storage medium of claim 24, the instructions further comprising:

crediting an amount to a trading credit balance associated with the trading member and deducting an amount from a trading credit balance associated with the receiving member.

26. The non-transitory computer-readable storage medium of claim 24, members having a trading credit balance less than a predetermined value from being selected as the receiving member.

27. The non-transitory computer-readable storage medium of claim 24, wherein the priority algorithm prohibits members having a predetermined number of trades initiated but not yet completed from being selected as the receiving member.

28. The non-transitory computer-readable storage medium of claim 24, wherein each member is associated with a quality balance score and each of the articles is associated with a quality article score, the quality balance score being the sum of the articles previously sent by the member and with the quality article score greater than the quality article score of the article that the member currently wants to receive minus the sum of the articles previously received by the member and with the quality article score greater than the quality score of the article that the member wants to receive, the quality article score being a function of the current demand for the article to the current supply of the article among the members, and wherein the priority algorithm uses at least the quality balance score as one of the factors in the priority algorithm.

29. The non-transitory computer-readable storage medium of claim 24, wherein the user interface further allows a member to view articles that other members are willing to trade and view articles that other members want to own.

30. The non-transitory computer-readable storage medium of claim 24, wherein each member has a mailing address, and the priority algorithm uses a distance between mailing addresses of members associated with the identified matches as one of the factors in the priority algorithm.

31. The non-transitory computer-readable storage medium of claim 24, the instructions further comprising:

calculating the amount of time since a member last received an article, wherein the priority algorithm uses the calculated amount of time as one of the factors.

32. The non-transitory computer-readable storage medium of claim 24, the instructions further comprising:

calculating a supply a supply/demand score for each article, the supply/demand score being a function of the supply of an article to the demand for an article;

calculating a supply/demand score ratio for each member, the supply/demand score ratio being a function of the supply/demand score for each article that a member ships at the time that the member ships the article to an average supply/demand score for all articles at the time that the member ships; and

calculating a running average of the supply/demand score ratio for each member,

wherein the supply/demand score is used as one of the factors in the priority algorithm.

33. The non-transitory computer-readable storage medium of claim 24, wherein the article trades are one-way article trades.