Computer methods and computer systems for facilitating automated sale transactions between buyers and sellers over the sale of fully pre-specified products and services

• US 8,666,840 B1
• Filed: 02/21/2013
• Issued: 03/04/2014
• Est. Priority Date: 02/29/2012
• Status: Active Grant

• Current Assignee: Apostolos Tsakpinis, Ioannis Tsakpinis, Victor Matsas
• Original Assignee: Apostolos Tsakpinis, Ioannis Tsakpinis, Victor Matsas
• Inventors: Matsas, Victor, Tsakpinis, Apostolos, Tsakpinis, Ioannis
• Primary Examiner(s): HAQ, NAEEM U
• Application Number:
  US13/773,122
• Time in Patent Office: 376 Days
• Field of Search: 705/26.1, 705/26.2, 705/26.25, 705/26.3, 705/26.35, 705/26.4, 705 2641- 2644, 705/26.5, 705 2661- 2664, 705/26.7, 705/26.8, 705/26.81, 705/26.82, 705/26.9, 705/27.1, 705/27.2
• US Class Current: 705/26.1
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 20/321 using wearable devices
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions

Abstract

In one embodiment, the instant invention provides for a method that includes the following steps of: programming a computer system to perform the steps of: receiving, from a seller, seller information for an item that the seller offers to sell; determining from the seller information: identifying characteristics that specifically describe the item and specifically identify the seller; Minimum Acceptable Price (MAP) and Minimum Acceptable Price Range (MAPR), and Maximum Allowable Number of Negotiating Chances per each buyer (MANBCs); receiving, from the potential buyer, a buyer offer for the first item and consummating a sale transaction when: a monetary amount or a range of monetary amounts submitted by the buyer respectively matches the MAP or the MAPR, and the potential buyer has not previously submitted an other offer for the item so that a total number of offers made by the potential buyer is equal or less than the MANBCs.

Claims

1. A computer-implemented method, comprising:

programming at least one computer system to perform at least the steps of;

receiving, by a computer system, from at least one first seller, first seller information for at least one first item that the at least one first seller offers to sell;

determining, by the computer system, from the seller information at least the following conditions for the at least one first item;

i) a plurality of first identifying characteristics that specifically describe the at least one first item and specifically identify the at least one first seller;

ii) a first Minimum Acceptable Price (a first MAP) that the at least one first seller is willing to accept and a first Minimum Acceptable Price Range (a first MAPR) within which the at least one first seller desires to receive at least one first offer to buy the at least one first item, and

iii) a first Maximum Allowable Number of Negotiating Chances (a first MANBCs) per each buyer;

displaying, by the computer system, to at least one first potential buyer, on a screen of a computer device, the plurality of first identifying characteristics of the at least one first item and at least one of;

i) at least one first option to enter a first monetary amount that the at least one first potential buyer agrees to pay for the at least one first item, or

ii) at least one second option to select a first range of monetary amounts that the at least one first potential buyer agrees to pay for the at least one first item;

receiving, by the computer system, from the at least one first potential buyer, at least one first buyer offer for the at least one first item;

consummating, by the computer system, at least one first sale transaction when;

i) the first monetary amount or the first range of monetary amounts of the at least one first buyer offer for the at least one first item respectively matches the first MAP or the first MAPR, and

ii) the at least one first potential buyer has not previously submitted at least one other offer for the at least one first item so that a total number of offers made by the at least one first potential buyer is equal or less than the first MANBCs, wherein the total number of offers made by the at least one first potential buyer is a count of the at least one first buyer offer and the at least one other offer that the at least one first potential buyer submitted for the at lest one first item; and

enabling, by the computer system, the at least one first potential buyer to submit at least one second buyer offer for the at least one first item when;

i) the monetary amount or range of monetary amounts of the at least one first buyer offer for the at least one first item do not respectively match the first MAP or the first MAPR, and

ii) the at least one first potential buyer has not previously submitted the at least one other offer for the at least one first item so that the total number of offers made by the at least one first potential buyer is equal or less than the first MANBCs, wherein the total number of offers made by the at least one first potential buyer is a count of the at least one first buyer offer and the at least one other offer that the at least one first potential buyer submitted for the at least one first item.

2. The computer-implemented method of claim 1, wherein the at least one item is at least one first product or at least one first service that the at least one first seller offers to sell.

3. The computer-implemented method of claim 1, wherein the displaying the at least one second option to select the first range of monetary amounts that the at least one first potential buyer agrees to pay for the at least one first item further comprises:

identifying each range of monetary amounts in a plurality of ranges of monetary amounts based on likelihood that the at least one first seller accepts the at least one first buyer offer or the at least one second buyer offer.

4. The computer-implemented method of claim 1, wherein the computer-implemented method further comprises:

changing, by the computer system, from the at least one first seller, the first MAPR when the at least on first seller receives no offers that matches the first MAPR after a pre-determine time period.

5. The computer-implemented method of claim 1, wherein the computer-implemented method further comprises:

varying, by the computer system, a number of the first MANBCs based on at least one monetary fee received from the at least one first potential buyer.

6. The computer-implemented method of claim 5, wherein the computer-implemented method further comprises:

increasing, by the computer system, the at least one monetary fee for buyer offer subsequent to the at least one first buyer offer.

7. The computer-implemented method of claim 5, wherein the computer-implemented method further comprises:

increasing, by the computer system, the at least one monetary fee for buyer offer subsequent to the at least one second buyer offer.

8. The computer-implemented method of claim 1, wherein the at least one first seller is a hotel and the at least one first item is a room in the hotel.

9. The computer-implemented method of claim 8, wherein the computer-implemented method further comprises:

dynamically adjusting, by the computer system, at least one of the first MAP, the first MAPR, and the first MANBCs, based a plurality of;

a) a date of booking;

b) a date of check-in;

c) days ahead of arrival;

d) room availability;

e) allotment booked;

f) occupancy level;

g) a total cost of the at least one first sale transaction;

h) times applied;

i) demand for at least one first identifying characteristic of the room;

j) at least one market characteristics of a market where the at least one first potential buyer is geographically located;

k) customer ID profile of the at least one first potential buyer;

l) at least one calendar date of stay;

m) a date of arrival;

n) a date of departure;

o) a length of stay;

p) a desired number of rooms;

q) a number of guests; and

r) a PAX combinations.

10. A programmed computer system, comprising:

a non-transient memory having at least one region for storing computer executable program code; and

at least one processor for executing the program code stored in the memory, wherein the program code comprises;

code to receive, from at least one first seller, first seller information for at least one first item that the at least one first seller offers to sell;

code to determine, from the seller information at least the following conditions for the at least one first item;

i) a plurality of first identifying characteristics that specifically describe the at least one first item and specifically identify the at least one first seller;

ii) a first Minimum Acceptable Price (a first MAP) that the at least one first seller is willing to accept and a first Minimum Acceptable Price Range (a first MAPR) within which the at least one first seller desires to receive at least one first offer to buy the at least one first item, and

iii) a first Maximum Allowable Number of Negotiating Chances (a first MANBCs) per each buyer;

code to display, to at least one first potential buyer, on a screen of a computer device, the plurality of first identifying characteristics of the at least one first item and at least one of;

i) at least one first option to enter a first monetary amount that the at least one first potential buyer agrees to pay for the at least one first item, or

ii) at least one second option to select a first range of monetary amounts that the at least one first potential buyer agrees to pay for the at least one first item;

code to receive, from the at least one first potential buyer, at least one first buyer offer for the at least one first item;

code to consummate at least one first sale transaction when;

i) the first monetary amount or the first range of monetary amounts of the at least one first buyer offer for the at least one first item respectively matches the first MAP or the first MAPR, and

ii) the at least one first potential buyer has not previously submitted at least one other offer for the at least one first item so that a total number of offers made by the at least one first potential buyer is equal or less than the first MANBCs, wherein the total number of offers made by the at least one first potential buyer is a count of the at least one first buyer offer and the at least one other offer that the at least one first potential buyer submitted for the at lest one first item; and

code to enable, the at least one first potential buyer to submit at least one second buyer offer for the at least one first item when;

i) the monetary amount or range of monetary amounts of the at least one first buyer offer for the at least one first item do not respectively match the first MAP or the first MAPR, and

ii) the at least one first potential buyer has not previously submitted the at least one other offer for the at least one first item so that the total number of offers made by the at least one first potential buyer is equal or less than the first MANBCs, wherein the total number of offers made by the at least one first potential buyer is a count of the at least one first buyer offer and the at least one other offer that the at least one first potential buyer submitted for the at least one first item.

11. The programmed computer system of claim 10, wherein the at least one item is at least one first product or at least one first service that the at least one first seller offers to sell.

12. The programmed computer system of claim 10, wherein the code to display the at least one second option to select the first range of monetary amounts that the at least one first potential buyer agrees to pay for the at least one first item further comprises:

code to identify each range of monetary amounts in a plurality of ranges of monetary amounts based on likelihood that the at least one first seller accepts the at least one first buyer offer or the at least one second buyer offer.

13. The programmed computer system of claim 10, wherein the programmed computer system further comprises:

code to enable the at least one first seller to change the first MAPR when the at least on first seller receives no offers that matches the first MAPR after a pre-determine time period.

14. The programmed computer system of claim 10, wherein the programmed computer system further comprises:

code to vary a number of the first MANBCs based on at least one monetary fee received from the at least one first potential buyer.

15. The programmed computer system of claim 14, wherein the programmed computer system further comprises:

code to increase the at least one monetary fee for buyer offer subsequent to the at least one first buyer offer.

16. The programmed computer system of claim 14, wherein the programmed computer system further comprises:

code to increase the at least one monetary fee for buyer offer subsequent to the at least one second buyer offer.

17. The programmed computer system of claim 10, wherein the at least one first seller is a hotel and the at least one first item is a room in the hotel.

18. The programmed computer system of claim 17, wherein the programmed computer system further comprises:

code to dynamically adjust at least one of the first MAP, the first MAPR, and the first MANBCs, based a plurality of;

a) a date of booking;

b) a date of check-in;

c) days ahead of arrival;

d) room availability;

e) allotment booked;

f) occupancy level;

g) a total cost of the at least one first sale transaction;

h) times applied;

i) demand for at least one first identifying characteristic of the room;

j) at least one market characteristics of a market where the at least one first potential buyer is geographically located;

k) customer ID profile of the at least one first potential buyer;

l) at least one calendar date of stay;

m) a date of arrival;

n) a date of departure;

o) a length of stay;

p) a desired number of rooms;

q) a number of guests; and

r) a PAX combinations.

19. A computer-implemented method, comprising:

displaying, by a computer device of at least one first potential buyer, a plurality of first identifying characteristics of at least one first item and at least one of;

i) at least one first option to enter a first monetary amount that the at least one first potential buyer agrees to pay for the at least one first item, or

ii) at least one second option to select a first range of monetary amounts that the at least one first potential buyer agrees to pay for the at least one first item, wherein the plurality of first identifying characteristics of the at least one first item specifically describe the at least one first item and specifically identify at least one first seller, and

wherein the plurality of first identifying characteristics of the at least one first item are based on first seller information for at least one first item that the at least one first seller offers to sell;

submitting, by the computer device of at least one first potential buyer, from the at least one first potential buyer, at least one first buyer offer for the at least one first item,

wherein the at least one first buyer offer for the at least one first item cause to consummate at least one first sale transaction when;

i) a first monetary amount or a first range of monetary amounts of the at least one first buyer offer for the at least one first item respectively matches a first Minimum Acceptable Price (a first MAP) that the at least one first seller is willing to accept or a first Minimum Acceptable Price Range (a first MAPR) within which the at least one first seller desires to receive offers to buy the at least one first item, and

and

ii) the at least one first potential buyer has not previously submitted at least one other offer for the at least one first item so that a total number of offers made by the at least one first potential buyer is equal or less than a first Maximum Allowable Number of Negotiating Chances (a first MANBCs), wherein the total number of offers made by the at least one first potential buyer is a count of the at least one first buyer offer and the at least one other offer that the at least one first potential buyer submitted for the at lest one first item; and

submitting, by the computer device of at least one first potential buyer, from the at least one first potential buyer, at least one second buyer offer for the at least one first item when;

i) the monetary amount or range of monetary amounts of the at least one first buyer offer for the at least one first item do not respectively match the first MAP or the first MAPR, and

ii) the at least one first potential buyer has not previously submitted the at least one other offer for the at least one first item so that the total number of offers made by the at least one first potential buyer is equal or less than the first MANBCs, wherein the total number of offers made by the at least one first potential buyer is a count of the at least one first buyer offer and the at least one other offer that the at least one first potential buyer submitted for the at least one first item.

20. The computer-implemented method of claim 19, wherein the at least one item is at least one first product or at least one first service that the at least one first seller offers to sell.

21. The computer-implemented method of claim 19, wherein the displaying the at least one second option to select the first range of monetary amounts that the at least one first potential buyer agrees to pay for the at least one first item further comprises:

identifying each range of monetary amounts in a plurality of ranges of monetary amounts based on likelihood that the at least one first seller accepts the at least one first buyer offer or the at least one second buyer offer.

22. The computer-implemented method of claim 19, wherein the computer-implemented method further comprises:

changing, by the computer system, from the at least one first seller, the first MAPR when the at least on first seller receives no offers that matches the first MAPR after a pre-determine time period.

23. The computer-implemented method of claim 19, wherein the computer-implemented method further comprises:

varying, by the computer system, a number of the first MANBCs based on at least one monetary fee received from the at least one first potential buyer.

24. The computer-implemented method of claim 23, wherein the computer-implemented method further comprises:

increasing, by the computer system, the at least one monetary fee for buyer offer subsequent to the at least one first buyer offer.

25. The computer-implemented method of claim 23, wherein the computer-implemented method further comprises:

increasing, by the computer system, the at least one monetary fee for buyer offer subsequent to the at least one second buyer offer.

26. The computer-implemented method of claim 19, wherein the at least one first seller is a hotel and the at least one first item is a room in the hotel.

27. The computer-implemented method of claim 26, wherein the computer-implemented method further comprises:

dynamically adjusting, by the computer system, at least one of the first MAP, the first MAPR, and the first MANBCs, based a plurality of;

a) a date of booking;

b) a date of check-in;

c) days ahead of arrival;

d) room availability;

e) allotment booked;

f) occupancy level;

g) a total cost of the at least one first sale transaction;

h) times applied;

i) demand for at least one first identifying characteristic of the room;

j) at least one market characteristics of a market where the at least one first potential buyer is geographically located;

k) customer ID profile of the at least one first potential buyer;

l) at least one calendar date of stay;

m) a date of arrival;

n) a date of departure;

o) a length of stay;

p) a desired number of rooms;

q) a number of guests; and

r) a PAX combinations.