SOCIOFINANCIAL SYSTEMS AND METHODS

• US 20080133402A1
• Filed: 09/05/2007
• Published: 06/05/2008
• Est. Priority Date: 09/05/2006
• Status: Abandoned Application

• Current Assignee: Kixia Incorporated
• Original Assignee: Kixia Incorporated
• Inventors: Patel, Paras, Kurian, Kerry Ivan
• Application Number:
  US11/850,610
• Publication Number:
  US 20080133402A1
• Time in Patent Office: Days
• US Class Current: 705/38
• CPC Class Codes: G06Q 40/02 Banking, e.g. interest calculation or account maintenance credit or loans G06Q40/03
• CPC Class Codes: G06Q 40/03 Credit; Loans; Processing thereof

Abstract

Embodiments of the present invention provide improved ways for lenders, creditors, and intermediaries to extend credit to borrowers, debtors, and intermediaries. A sociofinancial graph that encodes financial trust relationships between lenders, creditors, borrower, debtors, and intermediaries. Social networking websites can be used to construct the sociofinancial graph, with or without the use of credit scores.

Claims

1. A method comprising:

encoding a plurality of trust relationships as a graph including a plurality of vertices and a plurality of edges, each one of the vertices representing an entity and each one of the edges representing a discrete trust relationship, at least one of the discrete trust relationships including a dollar amount that an associated entity will guarantee; and

evaluating the graph to obtain a lending decision.

2. The method of claim 1 wherein one of the plurality of vertices represents a lender.

3. The method of claim 2, wherein the lender is selected from the group consisting of a financial institution, a credit card provider, and an individual.

4. The method of claim 1 wherein one of the plurality of vertices represents a borrower.

5. The method of claim 1 further comprising issuing a loan based upon the lending decision, the loan including an explicit guarantee for the dollar amount by the associated entity.

6. The method of claim 1 wherein one or more of the entities has an identity authenticated within the graph by a trusted third party.

7. The method of claim 1 further comprising:

receiving a modification to one of the discrete trust relationships from one of the entities;

authenticating an identity of the one of the entities; and

entering the modification into the graph.

8. The method of claim 7 further comprising re-evaluating the lending decision based upon the modification.

9. The method of claim 1, wherein the graph is a weighted flow network.

10. The method of claim 1, wherein the graph is a flow network.

11. The method of claim 1, wherein the graph is selected from the group consisting of a weighed directed graph, a directed graph, and an undirected graph.

12. The method of claim 1, wherein the graph is a flow network with gains.

13. A computer program product comprising computer executable code embodied in a computer readable medium that, when executing on one or more computing devices, performs the steps of:

encoding a plurality of trust relationships as a graph including a plurality of vertices and a plurality of edges, each one of the vertices representing an entity and each one of the edges representing a discrete trust relationship, at least one of the discrete trust relationships including a dollar amount that an associated entity will guarantee; and

evaluating the graph to obtain a lending decision.

14. The computer program product of claim 13 wherein one of the plurality of vertices represents a lender.

15. The computer program product of claim 14 wherein the lender is selected from the group consisting of a financial institution, a credit card provider, and an individual.

16. The computer program product of claim 13 wherein one of the plurality of vertices represents a borrower.

17. The computer program product of claim 13 further comprising computer executable code that performs the step of issuing a loan based upon the lending decision, the loan including an explicit guarantee for the dollar amount by the associated entity.

18. The computer program product of claim 13 wherein one or more of the entities has an identity authenticated within the graph by a trusted third party.

19. The computer program product of claim 13 further comprising computer executable code that performs the following steps:

receiving a modification to one of the discrete trust relationships from one of the entities;

authenticating an identity of the one of the entities; and

entering the modification into the graph.

20. The computer program product of claim 19 further comprising computer executable code that performs the step of re-evaluating the lending decision based upon the modification.

21. The computer program product of claim 13, wherein the graph is a weighted flow network.

22. The computer program product of claim 13, wherein the graph is a flow network.

23. The computer program product of claim 13, wherein the graph is selected from the group consisting of a weighted directed graph, a directed graph, and an undirected graph.

24. The computer program product of claim 13, wherein the graph is a flow network with gains.