REPUTATION MANAGEMENT IN A TRANSACTION PROCESSING SYSTEM
First Claim
1. A method, comprising:
- receiving information regarding a plurality of completed transactions from a plurality of users;
receiving, by a computing apparatus, a query from a first user regarding a proposed transaction;
determining, by the computing apparatus, at least one affinity between the first user and the plurality of users based on the information;
determining a ranking or expectation of success for each of a plurality of potential entities for the proposed transaction based on the at least one affinity;
selecting a plurality of selected entities based on the ranking or expectation of success for each of the potential entities; and
sending, in response to the query, the plurality of selected entities to the first user.
1 Assignment
0 Petitions
Accused Products
Abstract
A method includes: receiving information regarding a plurality of completed transactions from a plurality of users; receiving a query from a first user regarding a proposed transaction; determining at least one affinity between the first user and the plurality of users based on the information; determining a ranking or expectation of success for each of a plurality of potential entities for the proposed transaction based on the at least one affinity; selecting a plurality of selected entities based on the ranking or expectation of success for each of the potential entities; and sending, in response to the query, the plurality of selected entities to the first user.
381 Citations
20 Claims
-
1. A method, comprising:
-
receiving information regarding a plurality of completed transactions from a plurality of users; receiving, by a computing apparatus, a query from a first user regarding a proposed transaction; determining, by the computing apparatus, at least one affinity between the first user and the plurality of users based on the information; determining a ranking or expectation of success for each of a plurality of potential entities for the proposed transaction based on the at least one affinity; selecting a plurality of selected entities based on the ranking or expectation of success for each of the potential entities; and sending, in response to the query, the plurality of selected entities to the first user. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A system, comprising:
-
at least one processor; and memory storing instructions configured to instruct the at least one processor to; receive information regarding a plurality of completed transactions from a plurality of users; receive a query from a first user regarding a proposed transaction; determine at least one affinity between the first user and the plurality of users based on the information; determine a ranking or expectation of success for each of a plurality of potential entities for the proposed transaction based on the at least one affinity; select a plurality of selected entities based on the ranking or expectation of success for each of the potential entities; and send, in response to the query, the plurality of selected entities to the first user. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19)
-
-
20. A non-transitory computer-readable storage medium storing computer-readable instructions, which when executed, cause a computer system to:
-
receive information regarding a plurality of completed transactions from a plurality of users; receive, by a computing apparatus, a query from a first user regarding a proposed transaction; determine, by the computing apparatus, at least one affinity between the first user and the plurality of users based on the information; determine a ranking or expectation of success for each of a plurality of potential entities for the proposed transaction based on the at least one affinity; select a plurality of selected entities based on the ranking or expectation of success for each of the potential entities; and send, in response to the query, the plurality of selected entities to the first user.
-
Specification