LINKING USERS IN A NETWORK WITH COMPATIBLE DESIRED SOCIAL ACTIVITIES

• US 20130218972A1
• Filed: 02/15/2013
• Published: 08/22/2013
• Est. Priority Date: 02/16/2012
• Status: Abandoned Application

• Current Assignee: Social Intentions, Inc.
• Original Assignee: Social Intentions, Inc.
• Inventors: Joshi, Vinayak S.
• Application Number:
  US13/769,177
• Publication Number:
  US 20130218972A1
• Time in Patent Office: Days
• US Class Current: 709/204
• CPC Class Codes: H04L 67/535 Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34

Abstract

A technique for linking users in a network based upon compatible desired social activities. In a specific implementation the technique includes receiving a first set of desired social activities from a first user in a network towards a second user in a network and a second set of desired social activity from the second user towards the first user. The desired social activities can be compared to determine whether or not they are compatible. The first user and the second user can be linked if their desired social activities towards each other are compatible.

Claims

1. A method of linking users in a network based upon desired social activities comprising:

presenting first user information to a second user in a network and second user information to a first user in the network;

receiving a first set of desired social activities of the first user towards the second user and a second set of desired social activities of the second user towards the first user;

determining whether the first set of desired social activities are compatible with the second set of desired social activities;

linking the first user with the second user if the desired social activities are compatible.

2. The method of claim 1, further comprising informing the second user that the first set of desired social activities were received.

3. The method of claim 1, wherein linking the first user with the second user includes informing the first user and the second user that the first set of desired social activities are compatible with the second set of desired social activities.

4. The method of claim 1, wherein the first user information is obtained from the network and the second user information is obtained from the network.

5. The method of claim 1, wherein compatible is defined as when at least one desired social activity in the first set of desired social activities is the same as at least one desired social activity in the second set of desired social activities.

6. The method of claim 1, wherein compatible is defined as when at least one desired social activity in the first set of desired social activities is related to at least one desired social activity in the second set of desired social activities.

7. The method of claim 1, further comprising charging the first user a price.

8. The method of claim 7, wherein the price is based on either or both a number of desired social activities in the first set of desired social activities and types of desired social activities in the first set of desired social activities.

9. The method of claim 4, wherein the first user information and the second user information are obtained through an API of the network.

10. The method of claim 1, wherein the first set of desired social activities and second set of desired social activities is encrypted data.

11. A system for linking users in a network based upon desired social activities comprising:

a networking site server configured to present first user information to a second user in a network and second user information to a first user in the network;

an application server configured to receive a first set of desired social activities of the first user towards the second user and receive a second set of desired social activities of the second user towards the first user;

a compatibility engine configured to determine whether the first set of desired social activities are compatible with the second set of desired social activities and link the first user with the second user.

12. The system of claim 11, further comprising a communication server configured to inform the second user that the first set of desired social activities were received.

13. The system of claim 11, further comprising a communication server configured to inform the first user and the second user that the first set of desired social activities are compatible with the second set of desired social activity.

14. The system of claim 11, wherein compatible is defined as when at least one desired social activity in the first set of desired social activities is the same as at least one desired social activity in the second set of desired social activities.

15. The system of claim 11, wherein compatible is defined as when at least one desired social activity in the first set of desired social activities is related to at least one desired social activity in the second set of desired social activities.

16. The system of claim 11, further comprising a payment engine configured to charge the first user a price.

17. The system of claim 16, wherein the price is based on either or both a number of desired social activities in the first set of desired social activities and types of desired social activities in the first set of desired social activities.

18. A system for linking users in a network based upon desired social activities comprising:

means for presenting first user information to a second user in a network and second user information to a first user in the network;

means for receiving a first set of desired social activities of the first user towards the second user and receiving a second set of desired social activities of the second user towards the first user;

means for determining whether the first set of desired social activities are compatible with the second set of desired social activities;

means for linking the first user with the second user if the desired social activities are compatible.