System and method for offering, tracking and promoting loyalty rewards

Information

  • Patent Grant
  • 11720908
  • Patent Number
    11,720,908
  • Date Filed
    Thursday, January 30, 2020
    4 years ago
  • Date Issued
    Tuesday, August 8, 2023
    a year ago
Abstract
Data to define a travel rewards promotion is received over a network. The travel rewards promotion comprises traveler eligibility criteria and travel rewards criteria. At least one traveler is selected where the travel itinerary of the respective traveler matches traveler eligibility criteria for the promotion. The traveler is notified that he or she is eligible for the travel rewards promotion, the notification comprising a representation of the travel rewards criteria. A travel rewards promotion total is then compiled for the traveler and the traveler is notified of his or her respective promotion rewards total. In one embodiment, the traveler's current context is determined and matched to promotion alert criteria. The traveler is then alerted, over the network, that a travel rewards promotion is available to the respective traveler in the respective traveler's current context, the alert comprising a representation of the travel rewards criteria.
Description
FIELD OF THE TECHNOLOGY

The present invention relates to systems and methods for loyalty rewards programs, and more particularly, to systems and methods for system and methods for offering, tracking and promoting loyalty rewards including geographic focus.


BACKGROUND

When a credit card company sponsors a promotion offering extra “reward” points for certain credit card transactions, the current promotional process is very slow and cumbersome and has very limited dynamics. For example, a credit card provider must send out inserts or must print on the body of its statements, or must send out an email to all customers, notifying all customers about the promotion. Then it takes some time for this promotional message to propagate. Also, typically, to keep it simple, such promotions are limited to just one category of good or service, such as, for example, automobile fuel, groceries, certain types of house wares, etc.


What is needed is a system and method that allows card issuers to manipulate or control rewards based on time, geography, context of use, and type of merchandise or merchant, each singly or in any combination.


BRIEF SUMMARY

In one embodiment, the invention is a method. Data to define a travel rewards promotion is received over a network. The travel rewards promotion comprises traveler eligibility criteria and travel rewards criteria. At least one traveler is selected, using at least one computing device, where the travel itinerary of the respective traveler matches traveler eligibility criteria for the promotion. The traveler is notified that he or she is eligible for the travel rewards promotion, the notification comprising a representation of the travel rewards criteria. A travel rewards promotion total is then compiled for the traveler and the traveler is notified of his or her respective promotion rewards total.


In one embodiment, the method additionally comprises determining, using the computing device, the traveler's current context. The traveler's current context is then matched to promotion alert criteria. The traveler is then alerted, over the network, that a travel rewards promotion is available to the traveler in the traveler's current context, the alert comprising a representation of the travel rewards criteria.


In one embodiment, the invention is a system comprising a plurality of modules each comprising one or more processors programmed to execute software code retrieved from a computer readable storage medium storing software for various functions. The system comprises: a promotion data receiving module for receiving, over a network, data to define travel rewards promotions comprising traveler eligibility criteria and travel rewards criteria; a traveler selection module for selecting travelers wherein a travel itinerary of the respective travelers matches traveler eligibility criteria; an eligibility notification module for notifying, over the network, travelers that the respective travelers are eligible for the travel rewards promotions, the notifications comprising a representation of the travel rewards criteria; a travel rewards compilation module for compiling, a travel rewards promotion total for travelers; and a travel rewards notification module for notifying, over the network, travelers of the respective travelers' promotion rewards travel rewards promotion total.


In one embodiment, the system additionally comprises: a context determination module for determining traveler's current context; a context matching module for matching travelers' current context to promotion alert criteria; and a promotion alert module for alerting, over the network, travelers that travel rewards promotions are available to the respective traveler in the respective traveler's current context, the alerts comprising a representation of travel rewards criteria.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other objects, features, and advantages of the invention will be apparent from the following more particular description of preferred embodiments as illustrated in the accompanying drawings, in which reference characters refer to the same parts throughout the various views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating principles of the invention.



FIG. 1 shows an exemplary system according to one embodiment of the current system and method.



FIG. 2 shows a simplified architectural diagram of an exemplary computer such as server.



FIG. 3 shows an overview of a map that illustrates an exemplary reward trip where three cities have been chosen.



FIG. 4 illustrates one embodiment of a process for offering, tracking and promoting loyalty rewards, including geographic focus.





DETAILED DESCRIPTION

Various embodiments of the current system and method provide improved tools with faster response and flexible controls for offering, tracking and promoting loyalty rewards. For example, rather than doing a promotion for a certain category of merchandise, a company could target individuals who plan to travel, charging travel tickets and other travel goods and services on his credit card. The company already knows that the trip is planned, because travel reservations have been made and charged to the credit card. The company can notify the cardholder of a promotion keyed to his known travel plans. For example, the company could offer double points on any transaction during the trip, in the region of the cardholder's planned travel. Transactions could be tracked by using terminal location data (where the card is swiped) that is passed in the data from the merchant back to the card issuer. In particular, this approach is useful for reward trips, because it allows the company issuing the reward to recover some of the value of the reward by increasing sales revenue during the rewarded trip.


For the purposes of this disclosure the term “server” should be understood to refer to a service point which provides processing, database, and communication facilities. By way of example, and not limitation, the term “server” can refer to a single, physical processor with associated communications and data storage and database facilities, or it can refer to a networked or clustered complex of processors and associated network and storage devices, as well as operating software and one or more database systems and applications software which support the services provided by the server.


For the purposes of this disclosure, a computer readable medium stores computer data in machine readable form. By way of example, and not limitation, a computer readable medium can comprise computer storage media and communication media. Computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EPROM, EEPROM, flash memory or other solid-state memory technology, CD-ROM, DVD, or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other mass storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computer.


For the purposes of this disclosure a module is a software, hardware, or firmware (or combinations thereof) system, process or functionality, or component thereof, that performs or facilitates the processes, features, and/or functions described herein (with or without human interaction or augmentation). A module can include sub-modules. Software components of a module may be stored on a computer readable medium. Modules may be integral to one or more servers, or be loaded and executed by one or more servers. One or more modules may grouped into an engine or an application.



FIG. 1 illustrates one embodiment of a system 100 capable of supporting at various embodiments of processes for offering, tracking and promoting loyalty rewards. An electronic services portal ESP 102 is connected connect to at least one server 103 and at least one data repository 104. The server can host software instances, each comprising one or more modules, 105a-n implementing various embodiments of methods presented below, plus basic elements of the overall system, such as the operating system, as well as any other inherently needed or present software, which, depending on the implementation of the system, may be one, several, or many instances. These software are purely exemplary, and various other configurations are possible, as will be readily apparent to those skilled in the art. In one embodiment, the system 102 connects via Internet 101 to system users 106a-n and suppliers 107a-n. These connections could also be through direct connection, through a phone system, or through any other suitable networking method, known or to be invented. In one embodiment, the system is further capable of connecting to Personal Information Managers (PIMs, not shown) for the purpose of delivering various types of content to the PIMs.


In one embodiment, the electronic services portal ESP 102 provides travel-planning services. Such travel planning services could provide facilities to plan and coordinate travel itineraries for a large number of users. Such travel itineraries could include reservations for common carriers (e.g. airline reservations), ground transportation, accommodations, various rental services (e.g. car rental services), and dining. The system could further include profile information for users, including demographic information, travel preferences, relationships to other users and credit card, banking and other types of financial information. The electronic services portal ESP 102 could further be aware of the user's current context and predicted future contexts. A users context could include the user's geographical location (determined via GPS or implied from travel the data and time and the user's itinerary), and the presence or collocation of other users, various services (restaurants) within a given proximity (e.g. 0.1 miles). The electronic services portal ESP 102 may further be aware of the user's historical travel itineraries. The services provided by the electronic services portal ESP 102 could also include promotion creation and tracking services for tracking and promoting loyalty rewards programs as described in greater detail below



FIG. 2 shows a simplified architectural diagram of an exemplary computer such as server 103. Server 103 contains a CPU 201; a system bus 202; power supply unit 203; network interface 204; input/output (I/O) unit 205; a human interface device 206, which may or may not be present; removable media drive 207, which may be used to load software into the computer; hard drive 208, on which the software may be installed; and memory 209, which may include both RAM and nonvolatile memory for software such as a basic input output system (BIOS) and other system software, such as an operating system, for example MICROSOFT WINDOWS, LINUX, or any other, similar suitable software. In a networked environment, many of these elements could be moved to one or more other computer(s) and could communicate over a network (as connected to by network interface 204, for example, typically an Ethernet or similar type of network) with system 103. All these elements can be used operate a computer and to run the software instances 105a-n, which can be installed on the hard drive, even if said hard drive is not a local hard drive.



FIG. 3 shows an overview of a map 300 that illustrates an exemplary reward trip, where three cities have been chosen: New York, 301a, Miami, 301b, and Denver 301c. The locations together comprise a travel pattern for an individual traveler. A card issuer could target a specific reward traveler based on this specific travel itinerary, rather than on a country-wide promotion. For example, the reward trip may have been paid with points of a card-specific loyalty program. By enticing the card holder to maximize his use of the same card during the trip, additional revenue can be secured by encouraging to continue to use the same card.


In other cases, however, some local government or private agency, such as a Chamber of Commerce, for example, may sponsor a promotion to attract travelers to their own region, to a certain event or attraction, etc., so the promotion may not be limited to a specific reward traveler, but may extend to all card-holding travelers eligible for one or more rewards programs. Thus a credit card company could reward users with bonus points, such as, for example, double points on all transactions, during the time period of their trip. For example, if a user books a trip to New York for Christmas, all purchases made between the time of the outbound and the return flight would be eligible.


In some cases, narrow or broader promotion definitions may apply. A user may be informed via a map, or interactively via GPS, as discussed further below, as to what situation may apply. For example, if a user is in New York City, his bonus could extend to Queens, Long Island, or even Newark Airport. Depending on the bank, and on the accuracy of GPS and other system components, different rules might apply, but the user could find out ahead of time. In some cases, promotions might apply to a state or collection of states far enough away from the user's home address to provide a simple solution to make a determination of applicability of bonuses. Also, in some cases, certain types of merchandise may be excluded (i.e., furniture, computers, etc.) based on published rules. In yet other cases, all purchases made between the time of user's outbound and return flight would be eligible.



FIG. 4 illustrates one embodiment of a process for offering, tracking and promoting loyalty rewards. In step 401, the system compiles a list of travel destinations or other targets for reward promotions. In step 402, the relevant customers are notified. In one embodiment, travelers are selected based on promotion targeting criteria, which could include specific travel itineraries, user profile information, current user context and/or a user's predicted future context, or the collocation of related users. A travel itinerary could comprise a pattern of destinations, or could additional include more detailed aspects of a travel plan, such as hotel reservations, ground transportation reservations or reservations.


Relevant profile information for a user could comprise demographic information for the user, specific credit cards used and/or preferred by the user, and specific rewards programs a user is enrolled in. Targeting criteria could additionally comprise specific types of purchases made by users, such as, for example, purchases made with rewards points, purchases made by users using a specific credit card, and/or purchases made using one or credit cards that qualify for a specific rewards. Targeting criteria could specify that at least a portion of the itinerary was booked using a particular credit card or using some or all of the reward points available on such a credit card. Targeting criteria could specify that the timing of providing the promotion is based on travelers travel itinerary. More than one customer may participate in the promotion. For example, if a couple travels on the reward miles of one, but the other has a credit card by the same issuer, both of them may be notified, even though mileage from only one of them is used.


In step 403, emails or some other type of messages are sent, according to each customer's preferences (which may be stored in a user profile). Messages may be sent as call messages, text messages, IMs, emails, web site postings, and other types of messages that may be well known at present or in the future. In step 404 the system checks to determine whether the user has registered devices for receiving real-time or near real-time communication. If the system determines that a user has no registered devices (no), the process moves to step 406, where the system offers to register devices for the user, again, using the same methodology for messages.


Then in step 407 daily reward point totals are compiled and sent in step 413 to the user's registered device. In some cases, a user may be notified on a daily basis; in other cases, he may be notified of a total only at the end of a trip. The rewards points totals are determined according to the requirements of reward criteria within specific promotions, which could include, for example, the use of specific credit cards or the purchase of specific products or service, either generally, or in a specific context (e.g. a geographical location with a specific date range).


If the system determines in step 405 that the user has registered device(s) (yes), the process moves to step 408, where it again branches. In the case of a user device that has GPS capabilities (yes) the process branches to step 411. Devices having GPS capabilities should be broadly construed to include devices that can be geographically located by any means now known or later to be developed. For example, a user cell phone could be geo-located by triangulation, nearest cell tower, or an actual GPS device. The user GPS device can have software or hardware element that interfaces with a promotion tracking system using various techniques. There could be, for example an icon, for example, on the GPS device screen indicating to the user that he is in a “hot” zone for a promotion. This indicator icon could, in some cases, run continuously; while in other cases, the user could click on the icon for a fresh update. If the user's geographical location is known, the user's current context can be determined, which may trigger targeted promotions. If the user is, for example, near a specific participating merchant there may be opportunities to allow the merchant to offer additional bonuses as well.


If the user has no GPS device (no) and the user's location cannot be known or otherwise predicted with sufficient accuracy, the system may, alternatively, in step 409 send reminders to the user about promotions the user has been selected for. In step 410, messages with web links could be offered allowing the user to access an interactive map, showing the area of the promotion. Then the process moves to step 407, described above. Throughout this process, data may be retrieved from or saved to data repository (DR) 104 as needed (not shown).


Those skilled in the art will recognize that the methods and systems of the present disclosure may be implemented in many manners and as such are not to be limited by the foregoing exemplary embodiments and examples. In other words, functional elements being performed by single or multiple components, in various combinations of hardware and software or firmware, and individual functions, may be distributed among software applications at either the client level or server level or both. In this regard, any number of the features of the different embodiments described herein may be combined into single or multiple embodiments, and alternate embodiments having fewer than, or more than, all of the features described herein are possible. Functionality may also be, in whole or in part, distributed among multiple components, in manners now known or to become known. Thus, myriad software/hardware/firmware combinations are possible in achieving the functions, features, interfaces and preferences described herein. Moreover, the scope of the present disclosure covers conventionally known manners for carrying out the described features and functions and interfaces, as well as those variations and modifications that may be made to the hardware or software or firmware components described herein as would be understood by those skilled in the art now and hereafter.


Furthermore, the embodiments of methods presented and described as flowcharts in this disclosure are provided by way of example in order to provide a more complete understanding of the technology. The disclosed methods are not limited to the operations and logical flow presented herein. Alternative embodiments are contemplated in which the order of the various operations is altered and in which sub-operations described as being part of a larger operation are performed independently.


While various embodiments have been described for purposes of this disclosure, such embodiments should not be deemed to limit the teaching of this disclosure to those embodiments. Various changes and modifications may be made to the elements and operations described above to obtain a result that remains within the scope of the systems and processes described in this disclosure.

Claims
  • 1. A method comprising: receiving data representing a rewards promotion comprising eligibility criteria, alert criteria, and rewards criteria;determining a current context of a user;selecting the user when an itinerary of the user matches the eligibility criteria, the selection of the user based on determining that the user is currently traveling within a given proximity to a predefined promotion hot zone based on the current context of the user;matching the user's current context to the alert criteria;in response to matching the user's current context to the alert criteria, notifying the user that the user is eligible for the rewards promotion associated with the promotion hot zone, the notification comprising a representation of the rewards criteria;if the user's current context cannot be determined, sending at least one reminder message to the user, the reminder message comprising a representation of the rewards criteria;compiling a rewards promotion total for the user; andnotifying the user of the rewards promotion total.
  • 2. The method of claim 1, wherein the user's current context is determined by geo-locating a device of the user.
  • 3. The method of claim 1, wherein the user's current context is determined based on an estimation based on the user itinerary for the user.
  • 4. The method of claim 1, wherein the user's current context is determined by a location where the user's credit card was used.
  • 5. The method of claim 1, the eligibility criteria comprising using a credit card to book at least a portion of the itinerary.
  • 6. The method of claim 1, the eligibility criteria comprising using reward points accumulated for a credit card to book at least a portion of the itinerary.
  • 7. The method of claim 1, the eligibility criteria comprising using all of the reward points accumulated for the credit card to book at least a portion of the itinerary.
  • 8. The method of claim 1, wherein the user is selected based on at least a portion of a profile for the user.
  • 9. The method of claim 1, wherein the user is selected based on the user's membership in a rewards program.
  • 10. The method of claim 1, wherein the user is selected based on the user's ownership of a specific credit card.
  • 11. A non-transitory computer-readable storage medium for tangibly storing computer program instructions capable of being executed by a computer processor, the computer program instructions defining the steps of: receiving data representing a rewards promotion comprising eligibility criteria, alert criteria, and rewards criteria;determining a current context of a user;selecting the user when an itinerary of the user matches the eligibility criteria, the selection of the user based on determining that the user is currently traveling within a given proximity to a predefined promotion hot zone based on the current context of the user;matching the user's current context to the alert criteria;in response to matching the user's current context to the alert criteria, notifying the user that the user is eligible for the rewards promotion associated with the promotion hot zone, the notification comprising a representation of the rewards criteria;if the user's current context cannot be determined, sending at least one reminder message to the user, the reminder message comprising a representation of the rewards criteria;compiling a rewards promotion total for the user; andnotifying the user of the rewards promotion total.
  • 12. The non-transitory computer-readable storage medium of claim 11, wherein the user's current context is determined based on one or more of geo-locating a device of the user, an estimation based on the user itinerary for the user, or a location where the user's credit card was used.
  • 13. The non-transitory computer-readable storage medium of claim 11, the eligibility criteria comprising using a credit card to book at least a portion of the itinerary.
  • 14. The non-transitory computer-readable storage medium of claim 11, the eligibility criteria comprising using reward points accumulated for a credit card to book at least a portion of the itinerary.
  • 15. The non-transitory computer-readable storage medium of claim 11, wherein the user is selected based on one or more of: a portion of a profile for the user, the user's membership in a rewards program, or the user's ownership of a specific credit card.
  • 16. An apparatus comprising: a processor; anda storage medium for tangibly storing thereon program logic for execution by the processor, the stored program logic performing the operations of: receiving data representing a rewards promotion comprising eligibility criteria, alert criteria, and rewards criteria,determining a current context of a user,selecting the user when an itinerary of the user matches the eligibility criteria, the selection of the user based on determining that the user is currently traveling within a given proximity to a predefined promotion hot zone based on the current context of the user,matching the user's current context to the alert criteria,in response to matching the user's current context to the alert criteria, notifying the user that the user is eligible for the rewards promotion associated with the promotion hot zone, the notification comprising a representation of the rewards criteria,if the user's current context cannot be determined, sending at least one reminder message to the user, the reminder message comprising a representation of the rewards criteria,compiling a rewards promotion total for the user, andnotifying the user of the rewards promotion total.
  • 17. The apparatus of claim 16, wherein the user's current context is determined based on geo-locating a device of the user.
  • 18. The apparatus of claim 16, the eligibility criteria comprising using a credit card to book at least a portion of the itinerary.
  • 19. The apparatus of claim 16, the eligibility criteria comprising using reward points accumulated for a credit card to book at least a portion of the itinerary.
  • 20. The apparatus of claim 16, wherein the user is selected based on a portion of a profile for the user.
  • 21. The apparatus of claim 16, wherein the processor comprises a plurality of processors.
  • 22. The apparatus of claim 16, wherein the user's current context is determined based on an estimation based on the user itinerary for the user.
  • 23. The apparatus of claim 16, wherein the user's current context is determined based on a location where the user's credit card was used.
  • 24. The apparatus of claim 16, wherein the user is selected based on the user's membership in a rewards program.
  • 25. The apparatus of claim 16, wherein the user is selected based on the user's ownership of a specific credit card.
RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 12/771,919, filed Apr. 30, 2010 and entitled “System and Method for Offering, Tracking and Promoting Loyalty Rewards”, now U.S. Pat. No. 10,552,849, which claims priority to U.S. Prov. Pat. App. Ser. No. 61/174,445, filed on Apr. 30, 2009, and entitled “System and Method for Offering, Tracking and Promoting Loyalty Rewards Including Geographic Focus”, the entire disclosure of which is herein incorporated by reference in its entirety. This application includes material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent disclosure, as it appears in the Patent and Trademark Office files or records, but otherwise reserves all copyright rights whatsoever.

US Referenced Citations (564)
Number Name Date Kind
4812843 Champion, III et al. Mar 1989 A
4969136 Chamberlin et al. Nov 1990 A
5237499 Garback Aug 1993 A
5289531 Levine Feb 1994 A
5404291 Kerr et al. Apr 1995 A
5422816 Sprague et al. Jun 1995 A
5459859 Senda Oct 1995 A
5513126 Harkins et al. Apr 1996 A
5548515 Pilley et al. Aug 1996 A
5559707 DeLorme et al. Sep 1996 A
5615109 Eder Mar 1997 A
5615121 Babayev et al. Mar 1997 A
5623404 Collins et al. Apr 1997 A
5655081 Bonnell et al. Aug 1997 A
5754953 Briancon et al. May 1998 A
5765140 Knudson et al. Jun 1998 A
5790974 Tognazzini Aug 1998 A
5809250 Kisor Sep 1998 A
5812844 Jones et al. Sep 1998 A
5832451 Flake et al. Nov 1998 A
5832453 O'Brien Nov 1998 A
5839114 Lynch et al. Nov 1998 A
5850433 Rondeau Dec 1998 A
5862490 Sasuta et al. Jan 1999 A
5875436 Kikinis Feb 1999 A
5892909 Grasso et al. Apr 1999 A
5901352 St-Pierre et al. May 1999 A
5924080 Johnson Jul 1999 A
5933485 Chang et al. Aug 1999 A
5943652 Sisley et al. Aug 1999 A
5948040 DeLorme et al. Sep 1999 A
5953706 Patel Sep 1999 A
5963861 Hanson Oct 1999 A
5963913 Henneuse et al. Oct 1999 A
5966658 Kennedy, III et al. Oct 1999 A
5987377 Westerlage et al. Nov 1999 A
6009408 Buchanan Dec 1999 A
6011976 Michaels et al. Jan 2000 A
6016478 Zhang et al. Jan 2000 A
6018715 Lynch et al. Jan 2000 A
6023679 Acebo et al. Feb 2000 A
6023722 Colyer Feb 2000 A
6035332 Ingrassia, Jr. et al. Mar 2000 A
6038542 Ruckdashel Mar 2000 A
6041305 Sakurai Mar 2000 A
6044257 Boling et al. Mar 2000 A
6047327 Tso et al. Apr 2000 A
6049778 Walker et al. Apr 2000 A
6052563 Macko Apr 2000 A
6058179 Shaffer et al. May 2000 A
6076108 Courts et al. Jun 2000 A
6085166 Beckhardt et al. Jul 2000 A
6091956 Hollenberg Jul 2000 A
6094681 Shaffer et al. Jul 2000 A
6101480 Conmy et al. Aug 2000 A
6104788 Shaffer et al. Aug 2000 A
6119094 Lynch et al. Sep 2000 A
6134534 Walker et al. Oct 2000 A
6144942 Ruckdashel Nov 2000 A
6148261 Obradovich et al. Nov 2000 A
6157945 Balma et al. Dec 2000 A
6169955 Fultz Jan 2001 B1
6173279 Levin et al. Jan 2001 B1
6177905 Welch Jan 2001 B1
6189003 Leal Feb 2001 B1
6202062 Cameron et al. Mar 2001 B1
6216227 Goldstein et al. Apr 2001 B1
6236978 Tuzhilin May 2001 B1
6240396 Walker et al. May 2001 B1
6249252 Dupray Jun 2001 B1
6253369 Cloud et al. Jun 2001 B1
6286046 Bryant Sep 2001 B1
6292783 Rohler et al. Sep 2001 B1
6292830 Taylor et al. Sep 2001 B1
6295521 DeMarcken et al. Sep 2001 B1
6298352 Kannan et al. Oct 2001 B1
6301533 Markow Oct 2001 B1
6317686 Ran Nov 2001 B1
6321158 DeLorme et al. Nov 2001 B1
6327359 Kang et al. Dec 2001 B1
6334109 Kanevsky et al. Dec 2001 B1
6336072 Takayama et al. Jan 2002 B1
6341271 Salvo et al. Jan 2002 B1
6349238 Gabbita et al. Feb 2002 B1
6360205 Iyengar et al. Mar 2002 B1
6370566 Discolo et al. Apr 2002 B2
6374176 Schmier et al. Apr 2002 B1
6381640 Beck et al. Apr 2002 B1
6389454 Ralston et al. May 2002 B1
6392669 Matoba et al. May 2002 B1
6396920 Cox et al. May 2002 B1
6397191 Notani et al. May 2002 B1
6414635 Stewart et al. Jul 2002 B1
6418471 Shelton et al. Jul 2002 B1
6421705 Northrup Jul 2002 B1
6442526 Vance et al. Aug 2002 B1
6456207 Yen Sep 2002 B1
6456709 Cox et al. Sep 2002 B1
6457045 Hanson et al. Sep 2002 B1
6457062 Pivowar et al. Sep 2002 B1
6457132 Borgendale et al. Sep 2002 B1
6466161 Turetzky et al. Oct 2002 B2
6477503 Mankes Nov 2002 B1
6480830 Ford et al. Nov 2002 B1
6484033 Murray Nov 2002 B2
6501421 Dutta et al. Dec 2002 B1
6519571 Guheen et al. Feb 2003 B1
6529136 Cao et al. Mar 2003 B2
6553346 Walker et al. Apr 2003 B1
6571213 Altendahl et al. May 2003 B1
6574329 Takeuchi et al. Jun 2003 B2
6578005 Lesaint et al. Jun 2003 B1
6584448 Laor Jun 2003 B1
6584489 Jones et al. Jun 2003 B1
6587827 Hennig et al. Jul 2003 B1
6587835 Treyz et al. Jul 2003 B1
6591263 Becker et al. Jul 2003 B1
6611726 Crosswhite Aug 2003 B1
6618668 Laird Sep 2003 B1
6631363 Brown et al. Oct 2003 B1
6640230 Alexander et al. Oct 2003 B1
6643622 Stuart et al. Nov 2003 B2
6643639 Biebesheimer et al. Nov 2003 B2
6650902 Richton Nov 2003 B1
6658093 Langseth et al. Dec 2003 B1
6662016 Buckham et al. Dec 2003 B1
6675151 Thompson et al. Jan 2004 B1
6687678 Yorimatsu et al. Feb 2004 B1
6691029 Hughes et al. Feb 2004 B2
6691153 Hanson et al. Feb 2004 B1
6700535 Gilkes et al. Mar 2004 B2
6701311 Biebesheimer et al. Mar 2004 B2
6732080 Blants May 2004 B1
6732103 Strick et al. May 2004 B1
6741969 Chen et al. May 2004 B1
6757689 Battas et al. Jun 2004 B2
6766363 Rothschild Jul 2004 B1
6769009 Reisman Jul 2004 B1
6775371 Elsey et al. Aug 2004 B2
6785592 Smith et al. Aug 2004 B1
6788946 Winchell et al. Sep 2004 B2
6801226 Daughtrey Oct 2004 B1
6802005 Berson Oct 2004 B1
6804658 Lim et al. Oct 2004 B2
6826473 Burch et al. Nov 2004 B1
6837427 Overhultz et al. Jan 2005 B2
6842737 Stiles et al. Jan 2005 B1
6845370 Burkey et al. Jan 2005 B2
6847988 Foyouchi et al. Jan 2005 B2
6857017 Faour et al. Feb 2005 B1
6862575 Anttila et al. Mar 2005 B1
6868335 Obradovich et al. Mar 2005 B2
6882719 Lee Apr 2005 B2
6885996 Nicholson Apr 2005 B2
6901438 Davis et al. May 2005 B1
6907119 Case et al. Jun 2005 B2
6909903 Wang Jun 2005 B2
6934684 Alpdemir et al. Aug 2005 B2
6937991 Zompa et al. Aug 2005 B1
6944273 Huna Sep 2005 B2
6944479 Andaker et al. Sep 2005 B2
6958692 Ratschunas Oct 2005 B1
6959287 Rabideau et al. Oct 2005 B2
6970871 Rayburn Nov 2005 B1
6980993 Horvitz et al. Dec 2005 B2
6985902 Wise et al. Jan 2006 B2
6985939 Fletcher et al. Jan 2006 B2
6993503 Heissenbuttel et al. Jan 2006 B1
6993554 O'Donnell Jan 2006 B2
7010494 Etzioni et al. Mar 2006 B2
7013149 Vetro et al. Mar 2006 B2
7024205 Hose Apr 2006 B1
7027570 Pines et al. Apr 2006 B2
7031945 Donner Apr 2006 B1
7031998 Archbold Apr 2006 B2
7035811 Gorenstein Apr 2006 B2
7050986 Vance et al. May 2006 B1
7050987 Lettovsky et al. May 2006 B2
7054939 Koch et al. May 2006 B2
7065526 Wissner et al. Jun 2006 B2
7072666 Kullman et al. Jul 2006 B1
7072886 Salmenkaita et al. Jul 2006 B2
7076431 Kurganov et al. Jul 2006 B2
7076451 Coupland et al. Jul 2006 B1
7082402 Conmy et al. Jul 2006 B2
7092892 Sobalvarro et al. Aug 2006 B1
7092929 Dvorak et al. Aug 2006 B1
7099236 Yamagishi Aug 2006 B2
7099855 Nelken et al. Aug 2006 B1
7103572 Kawaguchi et al. Sep 2006 B1
7113797 Kelley et al. Sep 2006 B2
7123141 Contestabile Oct 2006 B2
7124024 Adelaide et al. Oct 2006 B1
7124089 Cornwell Oct 2006 B2
7130814 Szabo et al. Oct 2006 B1
7130885 Chandra et al. Oct 2006 B2
7136821 Kohavi et al. Nov 2006 B1
7139718 Jeyachandran et al. Nov 2006 B2
7139978 Rojewski et al. Nov 2006 B2
7152038 Murashita et al. Dec 2006 B2
7154621 Rodriguez et al. Dec 2006 B2
7161497 Gueziec Jan 2007 B2
7168077 Kim et al. Jan 2007 B2
7171369 Bertram et al. Jan 2007 B1
7188073 Tam et al. Mar 2007 B1
7188155 Flurry et al. Mar 2007 B2
7194417 Jones Mar 2007 B1
7213048 Parupudi et al. May 2007 B1
7222334 Casati et al. May 2007 B2
7233955 Machida et al. Jun 2007 B2
7236942 Walker et al. Jun 2007 B1
RE39717 Yates et al. Jul 2007 E
7249195 Panec et al. Jul 2007 B2
7259694 Myllymaki et al. Aug 2007 B2
7263664 Daughtrey Aug 2007 B1
7280823 Ternullo et al. Oct 2007 B2
7283970 Cragun et al. Oct 2007 B2
7284002 Doss et al. Oct 2007 B2
7284033 Jhanji Oct 2007 B2
7287093 Lynch et al. Oct 2007 B2
7289812 Roberts et al. Oct 2007 B1
7296017 Larcheveque et al. Nov 2007 B2
7299286 Ramsayer et al. Nov 2007 B2
7300346 Lydon et al. Nov 2007 B2
7305356 Rodon Dec 2007 B2
7305454 Reese et al. Dec 2007 B2
7308420 Storch et al. Dec 2007 B1
7328406 Kalinoski et al. Feb 2008 B2
7330112 Emigh et al. Feb 2008 B1
7337125 Kraft et al. Feb 2008 B2
7340048 Stern et al. Mar 2008 B2
7343165 Obradovich Mar 2008 B2
7343317 Jokinen et al. Mar 2008 B2
7343325 Shaver et al. Mar 2008 B2
7343338 Etkin Mar 2008 B2
7359716 Rowitch et al. Apr 2008 B2
7367491 Cheng et al. May 2008 B2
7370085 Brown et al. May 2008 B2
7376735 Straut et al. May 2008 B2
7383225 Hallihan Jun 2008 B2
7394900 Gerber et al. Jul 2008 B1
7395221 Doss et al. Jul 2008 B2
7395231 Steury et al. Jul 2008 B2
7403948 Ghoneimy et al. Jul 2008 B2
7409643 Daughtrey Aug 2008 B2
7412042 Henry Aug 2008 B2
7415510 Kramerich et al. Aug 2008 B1
7418409 Goel Aug 2008 B1
7424292 Kobylarz Sep 2008 B2
7426537 Lee et al. Sep 2008 B2
7430724 Othmer Sep 2008 B2
7441203 Othmer et al. Oct 2008 B2
7475145 Blizniak et al. Jan 2009 B2
7487112 Barnes, Jr. Feb 2009 B2
7506805 Chakravarthy Mar 2009 B1
7562027 Baggett et al. Jul 2009 B1
7599858 Grady et al. Oct 2009 B1
7603291 Raiyani et al. Oct 2009 B2
7620619 Walker et al. Nov 2009 B1
7681786 Chakravarthy Mar 2010 B1
7706808 Aggarwal et al. Apr 2010 B1
7742954 Handel et al. Jun 2010 B1
7806328 Chakravarthy Oct 2010 B2
7925540 Orttung et al. Apr 2011 B1
7970666 Handel Jun 2011 B1
8055534 Ashby et al. Nov 2011 B2
8117073 Orttung et al. Feb 2012 B1
8180796 Mah et al. May 2012 B1
8260921 Uyama et al. Sep 2012 B2
8332249 Aykin Dec 2012 B1
8543470 Grady et al. Sep 2013 B2
9117223 Handel et al. Aug 2015 B1
10217131 Handel et al. Feb 2019 B2
10552849 Mortimore, Jr. et al. Feb 2020 B2
20010014866 Conmy et al. Aug 2001 A1
20010014867 Conmy Aug 2001 A1
20010025314 Matsumoto et al. Sep 2001 A1
20010029425 Myr Oct 2001 A1
20010034626 Gillespie Oct 2001 A1
20010037250 Lefkowitz Nov 2001 A1
20010042010 Hassell Nov 2001 A1
20010044748 Maier Nov 2001 A1
20010047316 Hallihan Nov 2001 A1
20010049637 Tso Dec 2001 A1
20010051876 Seigel et al. Dec 2001 A1
20010056354 Feit et al. Dec 2001 A1
20020000930 Crowson et al. Jan 2002 A1
20020007327 Steury et al. Jan 2002 A1
20020010604 Block Jan 2002 A1
20020010664 Rabideau et al. Jan 2002 A1
20020013729 Kida Jan 2002 A1
20020016723 Matsui et al. Feb 2002 A1
20020023132 Tornabene et al. Feb 2002 A1
20020026336 Eizenburg et al. Feb 2002 A1
20020026356 Bergh et al. Feb 2002 A1
20020029178 Wiederin et al. Mar 2002 A1
20020032591 Mahaffy et al. Mar 2002 A1
20020032597 Chanos Mar 2002 A1
20020035474 Alpdemir Mar 2002 A1
20020046076 Baillargeon et al. Apr 2002 A1
20020046084 Steele et al. Apr 2002 A1
20020046301 Shannon et al. Apr 2002 A1
20020047861 LaBrie Apr 2002 A1
20020049644 Kargman Apr 2002 A1
20020055906 Katz et al. May 2002 A1
20020057212 Hamilton et al. May 2002 A1
20020067308 Robertson Jun 2002 A1
20020069093 Stanfield Jun 2002 A1
20020072938 Black et al. Jun 2002 A1
20020073088 Beckmann et al. Jun 2002 A1
20020077871 Udelhoven et al. Jun 2002 A1
20020082978 Ghouri et al. Jun 2002 A1
20020087367 Azani Jul 2002 A1
20020087384 Neifeld Jul 2002 A1
20020087706 Ogawa Jul 2002 A1
20020095333 Jokinen et al. Jul 2002 A1
20020095454 Reed et al. Jul 2002 A1
20020099613 Swart et al. Jul 2002 A1
20020103746 Moffett, Jr. Aug 2002 A1
20020107027 O'Neil Aug 2002 A1
20020111845 Chong Aug 2002 A1
20020111848 White Aug 2002 A1
20020115430 Hall Aug 2002 A1
20020116235 Grimm et al. Aug 2002 A1
20020116266 Marshall Aug 2002 A1
20020118118 Myllymaki et al. Aug 2002 A1
20020120519 Martin et al. Aug 2002 A1
20020120548 Etkin Aug 2002 A1
20020128903 Kernahan Sep 2002 A1
20020131565 Scheuring et al. Sep 2002 A1
20020143655 Elston et al. Oct 2002 A1
20020143819 Han et al. Oct 2002 A1
20020145561 Sandhu Oct 2002 A1
20020151321 Winchell et al. Oct 2002 A1
20020152190 Biebesheimer et al. Oct 2002 A1
20020156659 Walker et al. Oct 2002 A1
20020156731 Seki et al. Oct 2002 A1
20020156839 Peterson et al. Oct 2002 A1
20020160745 Wang Oct 2002 A1
20020161611 Price et al. Oct 2002 A1
20020161646 Gailey Oct 2002 A1
20020165732 Ezzeddine et al. Nov 2002 A1
20020165903 Zargham et al. Nov 2002 A1
20020174021 Chu et al. Nov 2002 A1
20020178034 Gardner et al. Nov 2002 A1
20020178226 Anderson et al. Nov 2002 A1
20020184302 Prueitt et al. Dec 2002 A1
20020194037 Creed et al. Dec 2002 A1
20020194262 Jorgenson Dec 2002 A1
20030004762 Banerjee et al. Jan 2003 A1
20030013438 Darby Jan 2003 A1
20030018499 Miller et al. Jan 2003 A1
20030018551 Hanson et al. Jan 2003 A1
20030018808 Brouk et al. Jan 2003 A1
20030023463 Dombroski et al. Jan 2003 A1
20030023499 Das et al. Jan 2003 A1
20030028390 Stern et al. Feb 2003 A1
20030033164 Faltings et al. Feb 2003 A1
20030033179 Katz et al. Feb 2003 A1
20030036917 Hite et al. Feb 2003 A1
20030036962 Holt Feb 2003 A1
20030040946 Sprenger et al. Feb 2003 A1
20030041178 Brouk et al. Feb 2003 A1
20030050964 Debaty et al. Mar 2003 A1
20030053459 Brouk et al. Mar 2003 A1
20030053611 Lee Mar 2003 A1
20030058842 Bud Mar 2003 A1
20030061145 Norrid Mar 2003 A1
20030065556 Takanashi et al. Apr 2003 A1
20030065805 Barnes, Jr. Apr 2003 A1
20030087648 Mezhvinsky et al. May 2003 A1
20030097302 Overhultz et al. May 2003 A1
20030100315 Rankin May 2003 A1
20030110070 De Goeij Jun 2003 A1
20030110091 Inaba et al. Jun 2003 A1
20030110104 King et al. Jun 2003 A1
20030120530 Casati et al. Jun 2003 A1
20030120593 Bansal et al. Jun 2003 A1
20030126095 Allen Jul 2003 A1
20030126205 Lurie Jul 2003 A1
20030126250 Jhanji Jul 2003 A1
20030132298 Swartz et al. Jul 2003 A1
20030140172 Woods et al. Jul 2003 A1
20030149641 Kouketsu et al. Aug 2003 A1
20030154116 Lofton Aug 2003 A1
20030154125 Mittal et al. Aug 2003 A1
20030158493 Goor et al. Aug 2003 A1
20030158776 Landesmann Aug 2003 A1
20030158784 Shaver et al. Aug 2003 A1
20030158847 Wissner et al. Aug 2003 A1
20030163251 Obradovich et al. Aug 2003 A1
20030165223 Timmins et al. Sep 2003 A1
20030171944 Fine et al. Sep 2003 A1
20030172020 Davies et al. Sep 2003 A1
20030182413 Allen et al. Sep 2003 A1
20030187705 Schiff et al. Oct 2003 A1
20030187743 Kumaran et al. Oct 2003 A1
20030194065 Langseth et al. Oct 2003 A1
20030195811 Hayes, Jr. et al. Oct 2003 A1
20030200146 Levin et al. Oct 2003 A1
20030204622 Blizniak et al. Oct 2003 A1
20030208754 Sridhar et al. Nov 2003 A1
20030212486 Hughes et al. Nov 2003 A1
20030217044 Zhang et al. Nov 2003 A1
20030220835 Barnes, Jr. Nov 2003 A1
20030229900 Reisman Dec 2003 A1
20030233265 Lee et al. Dec 2003 A1
20030233278 Marshall Dec 2003 A1
20040014457 Stevens Jan 2004 A1
20040015380 Timmins Jan 2004 A1
20040030568 Kocznar et al. Feb 2004 A1
20040039613 Maycotte et al. Feb 2004 A1
20040045004 Cheenath Mar 2004 A1
20040054569 Pombo et al. Mar 2004 A1
20040054574 Kaufman et al. Mar 2004 A1
20040064355 Dorenbosch et al. Apr 2004 A1
20040064503 Karakashian et al. Apr 2004 A1
20040064585 Doss et al. Apr 2004 A1
20040073615 Darling Apr 2004 A1
20040076280 Ando et al. Apr 2004 A1
20040078247 Rowe, III et al. Apr 2004 A1
20040078373 Ghoneimy et al. Apr 2004 A1
20040088107 Seligmann May 2004 A1
20040093290 Doss et al. May 2004 A1
20040098269 Wise et al. May 2004 A1
20040128173 Salonen Jul 2004 A1
20040128196 Shibuno Jul 2004 A1
20040139151 Flurry et al. Jul 2004 A1
20040142678 Krasner Jul 2004 A1
20040142709 Coskun et al. Jul 2004 A1
20040148207 Smith et al. Jul 2004 A1
20040153350 Kim et al. Aug 2004 A1
20040158493 Nicholson Aug 2004 A1
20040161097 Henry Aug 2004 A1
20040181461 Raiyani et al. Sep 2004 A1
20040181572 Lee et al. Sep 2004 A1
20040184593 Elsey et al. Sep 2004 A1
20040186891 Panec et al. Sep 2004 A1
20040193432 Khalidi Sep 2004 A1
20040193457 Shogren Sep 2004 A1
20040203909 Koster Oct 2004 A1
20040204977 Obert Oct 2004 A1
20040215517 Chen et al. Oct 2004 A1
20040220847 Ogushi et al. Nov 2004 A1
20040220854 Postrel Nov 2004 A1
20040224703 Takaki et al. Nov 2004 A1
20040225540 Waytena et al. Nov 2004 A1
20040238622 Freiberg Dec 2004 A1
20040243430 Horstemeyer Dec 2004 A1
20040248551 Rowitch et al. Dec 2004 A1
20040249700 Gross Dec 2004 A1
20040249758 Sukeda et al. Dec 2004 A1
20040267611 Hoerenz Dec 2004 A1
20050004819 Etzioni et al. Jan 2005 A1
20050010472 Quatse et al. Jan 2005 A1
20050014558 Estey Jan 2005 A1
20050024189 Weber Feb 2005 A1
20050027570 Maier et al. Feb 2005 A1
20050033614 Lettovsky et al. Feb 2005 A1
20050033615 Nguyen et al. Feb 2005 A1
20050033616 Vavul et al. Feb 2005 A1
20050033670 Cheng et al. Feb 2005 A1
20050039136 Othmer Feb 2005 A1
20050040230 Swartz et al. Feb 2005 A1
20050040944 Contestabile Feb 2005 A1
20050043974 Vassilev et al. Feb 2005 A1
20050053220 Helbling et al. Mar 2005 A1
20050071245 Norins, Jr. et al. Mar 2005 A1
20050086098 Fulton et al. Apr 2005 A1
20050091005 Huard Apr 2005 A1
20050101335 Kelly et al. May 2005 A1
20050125265 Bramnick et al. Jun 2005 A1
20050125439 Nourbakhsh et al. Jun 2005 A1
20050125804 Dievendorff et al. Jun 2005 A1
20050131761 Trika et al. Jun 2005 A1
20050138187 Breiter et al. Jun 2005 A1
20050143064 Pines et al. Jun 2005 A1
20050149385 Trively Jul 2005 A1
20050154736 Meikleham et al. Jul 2005 A1
20050197904 Baron Sep 2005 A1
20050209772 Yoshikawa et al. Sep 2005 A1
20050209902 Iwasaki et al. Sep 2005 A1
20050215247 Kobylarz Sep 2005 A1
20050227712 Estevez et al. Oct 2005 A1
20050228719 Roberts Oct 2005 A1
20050234928 Shkvarchuk et al. Oct 2005 A1
20050255861 Wilson et al. Nov 2005 A1
20050273373 Walker et al. Dec 2005 A1
20050288948 Devulapalli et al. Dec 2005 A1
20050288988 Yoshida et al. Dec 2005 A1
20060004511 Yoshikawa et al. Jan 2006 A1
20060009987 Wang Jan 2006 A1
20060010206 Apacible et al. Jan 2006 A1
20060020565 Rzevski et al. Jan 2006 A1
20060041477 Zheng Feb 2006 A1
20060059023 Mashinsky Mar 2006 A1
20060059024 Bailey et al. Mar 2006 A1
20060059107 Elmore et al. Mar 2006 A1
20060068787 Deshpande et al. Mar 2006 A1
20060080257 Vaughan et al. Apr 2006 A1
20060080321 Horn et al. Apr 2006 A1
20060085276 Hoech et al. Apr 2006 A1
20060085512 Handel et al. Apr 2006 A1
20060090185 Zito et al. Apr 2006 A1
20060095329 Kim May 2006 A1
20060111955 Winter et al. May 2006 A1
20060173747 Gantman et al. Aug 2006 A1
20060178932 Lang Aug 2006 A1
20060206412 Van Luchene et al. Sep 2006 A1
20060235754 Walker et al. Oct 2006 A1
20060247954 Hunt Nov 2006 A1
20060287897 Sobalvarro et al. Dec 2006 A1
20070011187 Chitgupakar et al. Jan 2007 A1
20070016439 Stiles et al. Jan 2007 A1
20070016514 Al-Abdulqader et al. Jan 2007 A1
20070033087 Combs et al. Feb 2007 A1
20070060099 Ramer et al. Mar 2007 A1
20070143153 Ashby et al. Jun 2007 A1
20070150349 Handel et al. Jun 2007 A1
20070162301 Sussman et al. Jul 2007 A1
20070162328 Reich Jul 2007 A1
20070174438 Johnson et al. Jul 2007 A9
20070179836 Juang et al. Aug 2007 A1
20070192186 Greene Aug 2007 A1
20070198432 Pitroda et al. Aug 2007 A1
20070208604 Purohit et al. Sep 2007 A1
20070244766 Goel Oct 2007 A1
20070270162 Hampel Nov 2007 A1
20080004917 Mortimore Jan 2008 A1
20080004918 Orttung et al. Jan 2008 A1
20080004919 Stubbs Jan 2008 A1
20080004921 Orttung et al. Jan 2008 A1
20080004980 Hernandez Jan 2008 A1
20080010100 Orttung et al. Jan 2008 A1
20080046298 Ben-Yehuda et al. Feb 2008 A1
20080052413 Wang Feb 2008 A1
20080065509 Williams Mar 2008 A1
20080086564 Putman et al. Apr 2008 A1
20080091477 Mortimore Apr 2008 A1
20080091478 Messa Apr 2008 A1
20080091479 Mortimore Apr 2008 A1
20080147450 Mortimore Jun 2008 A1
20080155470 Khedouri et al. Jun 2008 A1
20080201197 Orttung et al. Aug 2008 A1
20080201432 Orttung et al. Aug 2008 A1
20080248815 Busch Oct 2008 A1
20090006143 Orttung et al. Jan 2009 A1
20090030609 Orttung et al. Jan 2009 A1
20090030742 Orttung et al. Jan 2009 A1
20090030769 Orttung et al. Jan 2009 A1
20090055271 Drefs Feb 2009 A1
20090101710 Chakravarthy Apr 2009 A1
20090112639 Robinson Beaver Apr 2009 A1
20090125380 Otto et al. May 2009 A1
20090210261 Mortimore, Jr. Aug 2009 A1
20090248457 Munter et al. Oct 2009 A1
20100023357 Walker et al. Jan 2010 A1
20100023407 Grady et al. Jan 2010 A1
20100161392 Ashby et al. Jun 2010 A1
20100312611 Henderson et al. Dec 2010 A1
20100317420 Hoffberg Dec 2010 A1
20110004497 Mortimore, Jr. et al. Jan 2011 A1
20160055523 Handel et al. Feb 2016 A1
20190180323 Handel et al. Jun 2019 A1
Foreign Referenced Citations (2)
Number Date Country
2002334115 Nov 2002 JP
2004334409 Nov 2004 JP
Non-Patent Literature Citations (30)
Entry
Title: System and Method for Availability-Based Limited-Time Offerings and Transactions, U.S. Appl. No. 10/869,356, filed Jun. 15, 2004 Inventors: Patrick Grady et al.
Title: System and Method for Targeting Limited-Time Offer Based on Likelihood of Acceptance and Selecting Transmission Media Based on Customer Interest., U.S. Appl. No. 12/573,844, filed Oct. 5, 2009 Inventors: Patrick Grady et al.
Title: Method and system for prediction and delivery of time- and context-sensitive services, U.S. Appl. No. 11/321,769, filed Dec. 28, 2005 Inventors: Sean Handel et al.
Title: Method and system for resource planning for service provider, U.S. Appl. No. 11/388,540, filed Mar. 23, 2006 Inventors: Sean Handel et al.
Title: System for Resource Service Provider, U.S. Appl. No. 14/834,277, filed Aug. 24, 2015 Inventors: Sean Handel et al.
Title: System for Resource Service Provider, U.S. Appl. No. 16/276,213, filed Feb. 14, 2019 Inventors: Sean Handel et al.
Title: Method and system for traffic tracking and conversion tracking, U.S. Appl. No. 11/388,360, filed Mar. 23, 2006 Inventors: Sean Handel et al.
Title: Method and system for viral distribution of short-term location oriented offers, U.S. Appl. No. 11/395,413, filed Mar. 30, 2006 Inventors: Sean Handel et al.
Title: Method and system for culling star performers, trendsetters and connectors from a pool of users, U.S. Appl. No. 11/479,097, filed Jun. 30, 2006 Inventors: Sean Handel et al.
Title: System and Method for Offering, Tracking and Promoting Loyalty Rewards, U.S. Appl. No. 12/771,919, filed Apr. 30, 2010 Inventors: William Mortimore et al.
Alag, Satnam et al., U.S. Appl. No. 11/067,537, entitled “Platform for Multi-service Procurement,” filed Feb. 24, 2005.
Amendment and Response to Non-Final Office Action filed at the US Patent & Trademark Office on Oct. 27, 2008, for U.S. Appl. No. 11/388,360.
Business Editors, “Restaurant Row Selects ServeClick from Connectria to Power its Advanced Online Restaurant E-scheduling,” Business Wire, New York, Feb. 1, 2000.
Chakravarthy, Sriam et al., U.S. Appl. No. 11/178,107, entitled “Asynchronous, Location-Independent Web Service Invocation”, filed Jul. 7, 2005.
Grady, Patrick et al., U.S. Appl. No. 10/338,363, entitled “Automatic Services Exchange”, filed Jan. 7, 2003.
Grady, Patrick et al., U.S. Appl. No. 10/855,269, entitled “Coordination for Group Procurement of Services”, filed May 26, 2004.
Handel, Sean et al., U.S. Appl. No. 11/321,769, entitled “Method and System for Prediction and Delivery of Time and Context Sensitive Services”, filed Dec. 28, 2005.
Handel, Sean et al., U.S. Appl. No. 11/388,360, entitled “Method and System for Traffic Tracking and Conversion Tracking”, filed Mar. 23, 2006.
Handel, Sean et al., U.S. Appl. No. 11/388,540, entitled “Method and System for Resource Planning for Service Provider”, filed Mar. 23, 2006.
Handel, Sean et al., U.S. Appl. No. 11/395,413, entitled “Method and System for Viral Distribution of Short-term Location Orientated Offers”, filed Mar. 30, 2006.
Hernandez, Rick et al., U.S. Appl. No. 11/323,766, entitled “Method and System for Transferring of Stateful Screen in a Stateless Session”, filed Dec. 30, 2005.
Hwang, Yong Ho et al., “An efficient revocation scheme for stateless receievers,” Editors: Katsikas-S-K, Gritzalis-S, Lopez-J, Jun. 2004, pp. 1-2.
Kanaley, Reid, “More Ways Than One to Access Crowded AOL,” Philadelphia Enquirer, p. F1, Jan. 16, 1997.
Orbitz, LLC, search results of online search for flights at www.orbitz.com, Mar. 11, 2009.
Aranadi, Shiva et al., U.S. Appl. No. 11/315,421, entitled “Method and System for Interacting Via Messages with a Travel Services System”, filed Dec. 21, 2005.
Patwardhan, Shantau et al., U.S. Appl. No. 11/121,861, entitled “Method and System for Reporting Work Hours by Phone or Other E-Media”, filed May 3, 2005.
Patwardhan, Shantau et al., U.S. Appl. No. 11/178,032, entitled “Method and System for Booking an Open Return Ticket Online”, filed Jul. 7, 2005.
Reed, Dan et al., “More people find ways to squeeze fun into work trips; For many business travelers, taking family or friends on a trip at relatively low cost has become a handy job perk,” USA Today, McLean VA, May 20, 2003, p. E12.
Sharkey, Joe, “Leisure activities are increasingly being fitted in to help make life on the road less of a grind,” The New York Times, New York, N.Y., Apr. 18, 2001, p. C6.
Smith, Calvin et al., “The Talaris Services Business Language: A Case Study on Developing XML Vocabulaires Using the Universal Business Language,” School of Information Management & Systems, University of California, Sep. 2002, pp. 1-16.
Related Publications (1)
Number Date Country
20200167803 A1 May 2020 US
Provisional Applications (1)
Number Date Country
61174445 Apr 2009 US
Continuations (1)
Number Date Country
Parent 12771919 Apr 2010 US
Child 16777705 US