Restaurant directory and marketing system

• US 6,876,973 B1
• Filed: 04/03/2000
• Issued: 04/05/2005
• Est. Priority Date: 04/03/2000
• Status: Expired due to Fees

• Current Assignee: John Visconti
• Original Assignee: John Visconti
• Inventors: Visconti, John
• Primary Examiner(s): Laneau, Ronald
• Application Number:
  US09/542,018
• Time in Patent Office: 1,828 Days
• Field of Search: 705/5, 705/15
• US Class Current: 705/5
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 50/12 Hotels or restaurants

Abstract

A method useful with a computer network for providing a searchable data base of restaurants which can be accessed by prospective patrons, and once having obtained access the patron can then examine the listing and select the desired restaurant. Upon selection, the prospective patron exchanges with the restaurant data base an interactive information exchange in which the patron specifies the desired reservation date and time and the number of prospective guests. Upon receipt of this information a comparison is made between the seats desired and the number of seats estimated to be available at that time, and if the comparison matches then the requested reservation is confirmed. If there is no match, then an automated arithmetic process computes the next available time and submits that to the patron in the interactive process. In the course of the foregoing computation the process adopts a running average of occupancy intervals which is then used to estimate the next available time. This interval may be based on payment reconciliation, provided by a concurrently running process. Various attention garnering devices may be utilized by each restaaurant to attract the potential patrons.

Claims

1. A computer network assisted method for managing remotely requested restaurant seating reservations, comprising the steps of:

connecting a plurality of computer terminals to said network including a plurality of first computer terminals each associated with a corresponding one of a plurality of restaurants and a plurality of second computer terminals each associated with a corresponding one or more prospective restaurant patrons;

calculating on each said first computer terminal a continuously updated weighted use interval for each corresponding one of said restaurants, wherein each said calculated weighted use interval is determined by the further steps of;

recording the time of payment for restaurant services for each seat in the corresponding restaurant;

subtracting from said time of payment the time of the corresponding reservation of each said seat; and

,

averaging the time difference in said subtracting step with prior time differences for the seats of said corresponding restaurant;

communicating by way of a selected one of said second computer terminals to a first computer terminal associated with a selected one of said restaurants a reservation request signal including a desired time and number of seats;

computing at said first computer terminal associated with said selected one of said restaurants the number of seats available at the desired time at said selected restaurant on the bases of the most currently updated one of said calculated weighted use intervals and comparing said number of seats requested at said desired time against said number of seats available; and

accepting said reservation request signal if said number of seats requested is less than said number of seats available.

2. A method according to claim 1, further comprising:

proposing an alternative next available seating time if said number of seats requested is greater than said number of seats available at said requested time.