Method and system to provide user created social networks in a distributed commerce system

• US 20060271460A1
• Filed: 09/29/2005
• Published: 11/30/2006
• Est. Priority Date: 05/31/2005
• Status: Abandoned Application

• Current Assignee: PayPal, Inc. (PayPal Holdings, Inc.)
• Original Assignee: eBay Inc.
• Inventors: Hanif, Amjad
• Application Number:
  US11/238,310
• Publication Number:
  US 20060271460A1
• Time in Patent Office: Days
• US Class Current: 705/35
• CPC Class Codes: G06Q 20/102 Bill distribution or payments
• CPC Class Codes: G06Q 20/384 using social networks
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/04 Billing or invoicing
• CPC Class Codes: G06Q 30/0603 Catalogue ordering
• CPC Class Codes: G06Q 40/00 Finance; Insurance; Tax strategies; Processing of corporate or income taxes

Abstract

A system to identify a relationship network in a commerce system includes a first transaction identification module automatically to identify a first and a second party in a commerce network between whom a transaction has been at least partially successfully completed and to identify such parties as having a first degree relationship with one another. A network transaction identification module automatically identifies for the first party, at least one second degree party within the commerce network with whom the second party has at least partially successfully completed a transaction and automatically to identify such a party as having a second degree relationship with the first party. A network compiling module stores, in a memory network, data identifying the relationship network comprised of the first party and second party as having a first degree relationship and the at least one second degree party as having a second degree relationship with the first party.

Claims

1. A system to identify a relationship network in a commerce system, the system including:

a first transaction identification module automatically to identify a first and a second party in a commerce network between whom a transaction has been at least partially successfully completed and to identify such parties as having a first degree relationship with one another;

a network transaction identification module automatically to identify for the first party, at least one second degree party within the commerce network with whom the second party has at least partially successfully completed a transaction and automatically to identify such a party as having a second degree relationship with the first party; and

a network compiling module to store, in a memory network, data identifying the relationship network comprised of the first party and second party as having a first degree relationship and the at least one second degree party as having a second degree relationship with the first party.

2. A system according to claim 1, wherein the network transaction identification module is to identify for the second party, at least one second degree party within the commerce network with whom the first party has at least partially successfully completed a transaction and to identify the at least one second degree party as having a second degree relationship with the second party, and wherein the network compiling module is to store, in the memory, a network data identifying the relationship network as additionally comprising of at least one second degree party having a second degree relationship with the second party.

3. A system according to claim 2, wherein the network transaction identification module further is to identify for each of the first party'"'"'s at least one second degree party, at least one third degree party who has at least partially successfully completed a transaction with the first party'"'"'s at least one second degree party, and is to identify a that the first party has a third degree relationship with the at least one third degree party, and wherein the network compiling module is to store, in the memory, network data identifying the relationship network as additionally comprising of at least one third degree party having a third degree relationship with the first party.

4. A system according to claim 3, wherein the network transaction identification module further is to identify for each of the second party'"'"'s at least one second degree party, at least one third degree party who has at least partially successfully completed a transaction with the second party'"'"'s at least one second degree party and is to identify that the second party has a third degree relationship with the at least one third degree party, and wherein the network compiling module is to store in the memory network data identifying the relationship network as additionally comprising of at least one third degree party having a third degree relationship with the second party.

5. A system according to claim 1, further including a network criteria module to receive a maximum number of degrees input as a network constraint and wherein the network transaction identification module further is to identify for at least one of the first party and second party other parties with a degree of relationship less than or equal to the maximum number of degrees.

6. A system according to claim 1, further including a search module to receive other search criteria input from the first party or second party, and to search the relationship network using the search criteria.

7. A method of identifying a relationship network in a commerce system, the method including:

automatically identifying a first party and a second party in a commerce network between whom a transaction has been at least partially successfully completed;

automatically identifying the first party and the second party as having a first degree relationship with one another;

automatically identifying for the first party, at least one second degree party within the commerce network with whom the second party has at least partially successfully completed a transaction;

automatically identifying the at least one second degree party as having a second degree relationship with the first party; and

storing in a memory network data identifying the relationship network comprised of the first party and second party as having a first degree relationship and the at least one second degree party as having a second degree relationship with the first party.

8. A method according to claim 7, further including identifying for the second party, at least one second degree party within the commerce network with whom the first party has at least partially successfully completed a transaction and identifying the at least one second degree party as having a second degree relationship with the second party, and storing in the memory network data identifying the relationship network as additionally comprising of at least one second degree party having a second degree relationship with the second party.

9. A method according to claim 8 further including identifying for each of the first party'"'"'s at least one second degree party, at least one third degree party who has at least partially successfully completed a transaction with the first party'"'"'s at least one second degree party and identifying that the first party has a third degree relationship with the at least one third degree party, and storing in the memory network data identifying the relationship network as additionally comprising of at least one third degree party having a third degree relationship with the first party.

10. A method according to claim 9 further including identifying for each of the second party'"'"'s at least one second degree party, at least one third degree party who has at least partially successfully completed a transaction with the second party'"'"'s at least one second degree party and identifying that the second party has a third degree relationship with the at least one third degree party, and storing in the memory network data identifying the relationship network as additionally comprising of at least one third degree party having a third degree relationship with the second party.

11. A method according to claim 7 further including receiving a maximum number of degrees input as a network constraint and identifying for at least one of the first party and second party other parties with a degree of relationship less than or equal to the maximum number of degrees.

12. A method according to claim 7 further including receiving other search criteria input from the first party or second party and searching the relationship network using the search criteria.

13. A machine-readable medium comprising instructions, which when executed by a machine, cause the machine to perform a method of identifying a relationship network in a commerce system, the method including:

automatically identifying a first party and a second party in a commerce network between whom a transaction has been at least partially successfully completed;

automatically identifying the first party and the second party as having a first degree relationship with one another;

automatically identifying for the first party, at least one second degree party within the commerce network with whom the second party has at least partially successfully completed a transaction;

automatically identifying the at least one second degree party as having a second degree relationship with the first party; and

storing in a memory network data identifying the relationship network comprised of the first party and second party as having a first degree relationship and the at least one second degree party as having a second degree relationship with the first party.