A method for matching a buyer among a plurality of buyers to a seller among a plurality of sellers, comprising:
- receiving, at a dynamic database, buyer information comprising a buyer bid and a search radius from a first computer interface from each buyer among the plurality of buyers, wherein the buyer bid corresponds to an amount each buyer is willing to pay for a purchase of a good having a type, a unique identification and a suggested price, wherein the search radius corresponds to a maximum distance between each buyer and any seller related to the purchase of the good, wherein the dynamic database is configured to securely store real-time buyer, seller, and transactional information at a server;
- recording a time stamp for each buyer bid, wherein the time stamp corresponds to a time at which each buyer bid was received from the first computer interface;
- receiving, at the dynamic database, seller information comprising a lowest price from a second computer interface from each seller among the plurality of sellers, the lowest price corresponding to an amount each seller is willing to accept for sale of the good;
- in response to receiving the buyer information and the seller information, initiating a matching process at the dynamic database to convert each seller price into a comparative price to identify a matching seller and buyer bid, and if a match is identified, automatically updating, by the dynamic database, the seller inventory in real-time based on transactional information, to prevent duplicate sales, the matching process comprising:
- automatically computing through a processor a high price for each good from each seller relative to each buyer based on each lowest price and the suggested price, wherein the high price is more than the lowest price if the high price is less than the suggested price and the high price is the same as the lowest price if the high price is greater than or equal to the suggested price;
- automatically computing through the processor a final price for each good from each seller relative to each buyer based on each lowest price, each search radius, and each high price, wherein when the search radius is a low distance setting the final price as the high price, wherein when the search radius is a high distance setting the final price as the low price, and wherein when the search radius is between the low distance and the high distance setting the final price according to:
- FDPQij=HPQj−LMSRRi×(HPQj−LPQj)
- wherein FDPQij is the final price of a seller j for a buyer i within a greater than the low distance and less than the high distance search radius, wherein HPQj is the high price automatically computed for the seller j for the buyer i within the low distance search radius, wherein LMSRRi is a log multiplier search radius ratio in miles for the buyer i, and wherein LPQj is the low price of the seller j for the buyer i within a greater than or equal to the high distance search radius;
- automatically computing through the processor a ranking of each final price based on a distance from a corresponding buyer to a corresponding seller and a difference between the buyer bid of the corresponding buyer and the lowest price of the corresponding seller;
- and
- automatically matching a highest rank final price for the corresponding seller to an earliest received buyer bid that has not been matched if the good offered by the corresponding seller is available, wherein an identity of the corresponding seller is hidden from the buyer until the match between the corresponding seller and the buyer has been successfully completed;
- and
- updating the dynamic database, in real-time, with the matching seller and buyer bid.