System and method for management of email marketing campaigns

Information

  • Patent Grant
  • 12141834
  • Patent Number
    12,141,834
  • Date Filed
    Monday, March 15, 2021
    3 years ago
  • Date Issued
    Tuesday, November 12, 2024
    a month ago
  • CPC
  • Field of Search
    • CPC
    • G06Q30/0251
    • G06Q30/0207-0277
  • International Classifications
    • G06Q30/0251
    • Disclaimer
      This patent is subject to a terminal disclaimer.
      Term Extension
      0
Abstract
Systems, programs, non-transitory computer readable mediums, and methods of managing multiple and concurrent online advertising campaigns to eliminate user fatigue are disclosed. In particular, a campaign management server generates multiple target lists of users from a data warehouse for a plurality of pre-defined online advertising campaigns. The users on the target lists are selected to receive electronic communications, such as email or text, containing advertisements based upon target profiles associated with the campaigns as determined by marketing objectives. The advertising campaigns are prioritized such that users on a target list of a higher prioritized campaign are suppressed from lower prioritized campaigns in order to insure that the users receive a predetermined number of electronic communications within a set time frame.
Description
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable.


BACKGROUND
1. The Field of the Present Disclosure

The present disclosure relates generally to communication networks and e-commerce, and more particularly, but not necessarily entirely, to systems, programs, and methods of managing online advertising campaigns for e-commerce enterprises.


2. Description of Related Art

Electronic commerce, commonly known as “e-commerce,” involves the buying and selling of products or services using electronic systems, such as the Internet and other computer networks. E-commerce has grown to include electronic transactions conducted over smart phones and other emerging technologies. In a typical transaction, a consumer, sometimes referred to herein as a “user,” accesses an e-commerce website of an e-commerce enterprise from a user access device. The user may search the e-commerce website for desired products or services using a local search engine. In addition, the user may search the e-commerce website for desired products through a product hierarchy. Using an established checkout procedure, the user is able to purchase the desired product or service from the e-commerce website as is known to those having skill in the art.


Operators of e-commerce enterprises track data regarding their users. In some instances, an e-commerce enterprise may gather demographic data about its users as well as purchasing habits and other information. Operators of e-commerce enterprises often engage in active marketing campaigns to drive traffic to their e-commerce websites. These marketing campaigns may involve targeting previous users based on the data collected for the users. One type of marketing campaign involves sending targeted electronic communications, such as emails or text messages, to users. The communications typically include advertisements, such as product promotions and other advertisements, within the body of the message. The body of the message typically includes a link to an e-commerce webpage such that users can quickly review further information about the products or make product purchases.


As mentioned, marketing campaigns may be specifically targeted to users. To implement a targeted marketing campaign, e-commerce enterprises may track and store user information in a data warehouse. For example, the user information may include demographic information about the users visiting an e-commerce website, such as e-mail addresses, cell phone numbers, gender, age, education, interests, hobbies, etc. In addition, the user information may include user history information regarding a user's interaction with an e-commerce website, such as information regarding prior purchases, items viewed, items placed into a virtual shopping cart but removed prior to purchase, etc.


The user information tracked and stored by an e-commerce website is commonly utilized to generate targeted online advertising campaigns. That is, an e-commerce enterprise may generate an online advertising campaign that targets users who may be interested in a specific product or service as determined from their stored user information.


As will be understood by those having ordinary skill in the relevant art, generating an online electronic advertising campaign is a time-intensive process for large e-commerce enterprises. For example, the marketing department of the e-commerce enterprise selects the product or service to be advertised and creates an electronic template of the promotion. Next, the marketing department identifies the profile of the targeted users, i.e., a target profile. Once the target profile is identified, a query of a data warehouse is performed to identify users matching the target profile and generate a list of targeted users. Next, a customized electronic communication for each user is generated from the template using a computer. If the number of targeted users is large, this step may take several hours or even days. Lastly, the electronic communication is sent to each of the targeted users. Again, the above process can take several hours or days depending on the size of the campaign.


One drawback to the widespread use of electronic marketing campaigns is that of user fatigue. User fatigue occurs when users receive multiple electronic communications from an e-commerce enterprise within a short time frame. When user fatigue occurs, campaigns become less effective and may even cause users to opt out of future campaigns. In particular, users' in-boxes are often bombarded with advertisements from e-commerce enterprises. For example, in some instances, users may receive several emails a day from the same e-commerce enterprise. This typically occurs when a user's profile matches the target profile of several concurrent running marketing campaigns implemented by an e-commerce enterprise. In the past, there have been ineffective tools for coordinating between two or more concurrent marketing campaigns to prevent users from receiving multiple communications within a given time period.


The prior art is thus characterized by several disadvantages that are addressed by the present disclosure. The present disclosure minimizes, and in some aspects eliminates, the above-mentioned failures, and other problems, by utilizing the methods and structural features described herein.


The features and advantages of the present disclosure will be set forth in the description that follows, and in part will be apparent from the description, or may be learned by the practice of the present disclosure without undue experimentation. The features and advantages of the present disclosure may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the disclosure will become apparent from a consideration of the subsequent detailed description presented in connection with the accompanying drawings in which:



FIG. 1 is a schematic diagram of a system for managing online advertising campaigns pursuant to an illustrative embodiment of the present disclosure;



FIG. 2 is a schematic diagram of a table of user data in a data warehouse of an e-commerce enterprise pursuant to an illustrative embodiment of the present disclosure;



FIG. 3 depicts exemplary lists of targeted users for online marketing campaigns pursuant to an illustrative embodiment of the present disclosure;



FIG. 4 depicts a revised or suppressed exemplary list of targeted users for an online marketing campaign pursuant to an illustrative embodiment of the present disclosure; and



FIG. 5 is a schematic flow chart of a method of managing multiple e-marketing campaigns according to an illustrative embodiment of the present disclosure.





DETAILED DESCRIPTION

For the purposes of promoting an understanding of the principles in accordance with the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe them. It will nevertheless be understood that no limitation of the scope of the disclosure is thereby intended. Any alterations and further modifications of the inventive features illustrated herein, and any additional applications of the principles of the disclosure as illustrated herein, which would normally occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the disclosure claimed.


It must be noted that, as used in this specification and the appended claims, the singular forms “a,” “an,” and “the” include plural referents unless the context clearly dictates otherwise. In describing and claiming the present disclosure, the following terminology will be used in accordance with the definitions set out below. As used herein, the terms “comprising,” “including,” “containing,” “having,” “characterized by,” and grammatical equivalents thereof are inclusive or open-ended terms that do not exclude additional, unrecited elements or method steps.


Various embodiments of the present invention advantageously provide systems, devices, programs, non-transitory computer readable mediums, and methods for managing multiple e-marketing campaigns to reduce user fatigue and to increase user responses.


Referring now to FIG. 1, according to examples of embodiments of the present invention, a system 100 can be utilized to conduct e-commerce with users. In particular, the system 100 comprises an e-commerce enterprise 102. The e-commerce enterprise 102 comprises a plurality of servers, including an e-commerce server 104, a data warehouse server 106, and an e-campaign management server 108. The e-commerce enterprise 102 may include additional servers. Further, it will be appreciated that the e-commerce server 104, the data warehouse server 106, and the e-campaign management server 108 may be located in the same physical location or at remote physical locations.


In an illustrative embodiment, the e-commerce server 104, the data warehouse server 106, and the e-campaign management server 108 may each comprise multi-processor computers, server farms, multiple computer systems, multiple databases and storage devices (including hierarchies of storage and access), and other implementations that will be recognized by those having skill in the art as encompassed within the embodiments of the present invention. For example, a single computer, a plurality of computers, a server, or server cluster or server farm may be employed to implement each of the e-commerce server 104, the data warehouse server 106, and the e-campaign management server 108, and this disclosure does not limit any configuration of computers and servers for each.


Moreover, each of the e-commerce server 104, the data warehouse server 106, and the e-campaign management server 108 may each be deployed as a server farm, data center or server cluster managed by a server host, and the number of servers and their architecture and configuration may be increased based on usage, demand, and capacity requirements for the system. Moreover, illustrative embodiments of the e-commerce server 104, the data warehouse server 106, and the e-campaign management server 108 may each include clusters of computers, servers, storage devices, display devices, input devices and other components interacting together, as understood by those skilled in the art.


As illustrated in FIG. 1, the e-commerce server 104 includes a processor 110 coupled to a memory 112. Stored in the memory 112 is an e-retailer program 114 that contains instructions that are executable by the processor 110. The e-commerce server 104 may also include a storage medium 116 for storing operational data. When executed, the e-retailer program 114 allows users at remote computing devices 150 to engage in e-commerce with the e-commerce server 104.


In particular, each remote computing device 150 may include a processor 152 coupled to a memory 154. Each remote computing device 150 may further include one or more user input devices (not shown) such as computer mouses, keyboards, and touch screens. In an illustrative embodiment, stored in the memory 154 may be a web browser program 156. As is known to one having ordinary skill in the art, the web browser program 156 is a program used for retrieving, presenting, and traversing information resources on the World Wide Web over the network 120. To engage in e-commerce with the e-commerce server 104, users navigate to a website hosted by the e-commerce server 104 using the web browser program 156. The users may then buy goods or services electronically from the e-commerce server 104 using the web browser program 156.


To facilitate e-commerce, the e-retailer program 114 may provide a search feature whereby users can search for desired products listed for sale on the website hosted by the e-commerce server. For example, the e-retailer program 114 may provide product webpages featuring products for sale. The e-retailer program 114 may provide a checkout procedure such that users can provide payment, shipping, and contact information for purchased products.


In an illustrative embodiment, users may be prompted by the e-retailer program 114 to register with the e-commerce enterprise 102. To register, users may be required to provide electronic contact information, such as an e-mail address or a cell phone number capable of receiving texts. In addition, the e-retailer program 114 may prompt users to provide demographic information, including age, income, gender, hobbies, and general interests. Additional demographic information about users may be obtained from third-party sources.


The remote computing devices 150 may each include a communication program 158. The communication program 158 may enable the remote computing devices 150 to send and receive electronic messages. In an illustrative embodiment, the communication program 158 is an email program. In another illustrative embodiment, the communication program 158 is a texting program. In still another illustrative embodiment, the remote computing devices 150 may include a storage medium 160 for storing operational data. In yet another illustrative embodiment, the communication program 158 may be a web browser that allows users to access online communication websites, such as Gmail, Yahoo, MSN, or any other websites that provide email services of the web.


In an illustrative embodiment, the remote computing devices 150 are computers, such as desktop or laptop computers. In another illustrative embodiment, the remote computing devices 150 are smart phones. In still another illustrative embodiment, the remote computing devices 150 are tablet computers, smart music players or wireless web-enabled electronic devices. Thus, it will be appreciated that the remote computing devices 150 can take a wide variety of forms, all of which fall within the scope of the present disclosure. In an illustrative embodiment, the e-retailer program 114 includes a tracking feature on webpages that tracks information about users as the users interact with the e-commerce server 104 from the remote computing devices 150. In an illustrative embodiment, the tracking feature is operated by a third party. In an illustrative embodiment, the tracked information can include a wide range of information, including, but not limited to, products viewed, search terms used in product searches, purchases made, products placed in a virtual shopping cart but not purchased (sometimes referred to as “abandoned carts”), and other information that may indicate a user's interest in a product. In an illustrative embodiment, a third-party entity may track the users' interaction with the e-commerce server 104 as is known to one having ordinary skill in the art. As used herein, the term “product” may refer to a product or a service.


The user information, described above, is organized and stored by the data warehouse server 106. The data warehouse server 106 includes a processor 130 coupled to a memory 132. Stored in the memory 132 is a database management program 134 that contains instructions that are executable by the processor 130. The data warehouse server 106 may also include a storage medium 136 for storing the warehoused data in a database format as is known to those skilled in the art. As used herein, the term “storage medium” may refer to a hard disk array that links multiple physical hard drives into one large “drive” for advanced data control.


The database management program 134 is software that controls the creation, maintenance, and use of the database of user information on the storage medium 136. The database management program 134 may perform operations on the database, such as a query of the database for requested information. The data warehouse server 106 may also include product information. In an illustrative embodiment, the product information may include images and product descriptions. In another illustrative embodiment, the product information may further include pricing information.


The e-campaign management server 108 includes a processor 140 coupled to a memory 142. Stored in the memory 142 is an e-campaign management program 144 and an e-campaign delivery program 146, each of which contains instructions that are executable by the processor 140. The e-campaign management server 108 may also include a storage medium 148 for storing data, as is known to one having ordinary skill in the art.


In an illustrative embodiment, the e-campaign management program 144 allows the operator of the e-commerce enterprise 102 to define e-marketing campaigns. In particular, the e-campaign management program 144 allows the operator to define the recipients for an e-marketing campaign. As used herein, an e-marketing campaign can be an advertising campaign performed using a communications network.


In addition, the e-campaign management program 144 allows the operator to define the e-marketing contents of the electronic messages of e-marketing campaigns. In an illustrative embodiment, the e-campaign management program 144 allows the operator to define a template with variables. The variables are populated with data. The e-marketing contents may include customized text and graphics. The e-marketing contents may include links to product webpages hosted by the e-commerce server 104 on the network 120. The delivery channels for an e-marketing campaign include, but are not limited to, email, text messages, banner ads, websites, etc. It will be appreciated that e-marketing content can be provided through any electronic communication channel. The network 120 may include wired and wireless networks.


The e-campaign management program 144 allows multiple e-marketing campaigns to be ongoing simultaneously. E-marketing campaigns may be run automatically on a recurring basis. For example, e-marketing campaigns may be defined to run hourly, daily, weekly or monthly. Additionally, e-marketing campaigns may be run on a one-time basis, such as in the case of a special promotion on a product.


To initiate an e-marketing campaign, the e-campaign management program 144 allows an operator to define a target profile for the recipients. For example, the target profile may include all users who abandoned a product in a virtual shopping cart within a preset time period, such as within the last 24 hours. In another example, the target profile may include all users who may be potentially interested in a particular product. In another example, the target profile may include all users who have selected to receive advertisements.


Once the operator has defined the target profile, the e-campaign management program 144 allows the operator to define the e-marketing content for the campaign. To facilitate customized content, the e-campaign management program 144 allows an operator to create a template for the e-marketing content. In an illustrative embodiment, the e-marketing content is customized for each recipient using the template. For example, for an abandoned cart campaign, the e-marketing content may include an image of the product that was abandoned by the user as well as a link to a specific product webpage hosted by the e-commerce server 104. Other campaigns, such as for a special promotion for a product, may send the same e-marketing content. But, even for these type of campaigns, some of the e-marketing content may be customized, such as the name of the user.


The e-campaign management program 144 allows an operator to assign a priority level or ranking to each e-campaign. In particular, e-campaigns that have historically higher response rates are given a higher priority level than e-campaigns with lower response rates. For example, an e-campaign that targets users who have recently abandoned an item in a virtual shopping cart may be given a higher priority level than an e-campaign that features a product. This is because abandoned cart e-campaigns typically have a relatively high response rate as compared to e-campaigns that just feature a product.


The e-campaign management program 144 may allow an operator to assign a run time. In an embodiment, an e-campaign may run hourly, daily, weekly, or monthly. For example, the e-campaign management program 144 may run an abandoned cart campaign daily. The e-campaign management server 108 may generate multiple e-campaigns concurrently.


To form an e-campaign, the e-campaign management program 144, performs a query of the user information maintained by the data warehouse server 106. In particular, the e-campaign management program 144 requests that the data warehouse server 106 identify those users whose profile matches the target profile defined by the operator. In addition, the e-campaign management program 144 requests that the data warehouse server 106 return the necessary e-marketing content for each user. Again, the e-marketing content includes information necessary to complete the template for the e-marketing campaign, including, but not limited to, user name, user contact information, link information to product webpages, product images, product price, and any other information necessary to populate the template. In an illustrative embodiment, the e-commerce server 104, the data warehouse server 106, and the e-campaign management server 108 are connected over a local area network or a wide area network.


The e-campaign management program 144 stores the returned information from the data warehouse server 106 using data tables in the storage medium 148. For example, the data, or data location, to be utilized for each targeted user are stored in a row of a data table 170 as shown in FIG. 2. The data table 170 may identify each user by a user ID number. The Data 1 through Data N may include the data necessary to complete a customized template for each user. The Data 1 through Data N may further include contact information for the user, such as an email address or cell phone number.


In an illustrative embodiment, the e-campaign management program 144 allows the operator to define a maximum number of electronic communications received by a user within a given time frame. For example, the operator may specify that a user may not receive more than one electronic communication from the e-commerce enterprise 102 per day.


Once the data table 170 is complete, there is typically a brief period of time between the completion of the data table 170 and the actual implementation of the e-marketing campaign, i.e., the transmission of the electronic messages to the targeted users. During this time period, the e-campaign management program 144 may suppress a user from an e-marketing campaign if the number of electronic communications sent to that user within a predetermined time frame exceeds the threshold established by the operator of the e-commerce enterprise 102.


In addition, during the time period between the identification of the targeted users and the actual implementation of an e-marketing campaign, i.e., the transmission of the electronic messages to the targeted users, the e-campaign management program 144 compares the priority level of all co-pending e-marketing campaigns. In an illustrative embodiment, targeted users in low priority e-marketing campaigns are suppressed in favor of high priority e-marketing campaigns. As will be explained below, this is accomplished by comparing the data tables 170 of different e-marketing campaigns and determining users who are targeted in both campaigns. Targeted users appearing in multiple e-marketing campaigns are suppressed from the lower priority campaigns.


Referring now to FIG. 3, there is depicted an exemplary data table 200 for a first campaign, labeled as “Target List A,” and an exemplary second data table 202 for a second campaign, labeled as “Target List B.” It will be appreciated that the data tables 200 and 202 may contain additional data such as explained in relation to the data table 170 depicted in FIG. 2. However, for purposes of clarity, only one column in each of data tables 200 and 202 is depicted.


As can be observed, each of the data tables 200 and 202 comprises a list of targeted users for each of their respective e-marketing campaigns. As can be further observed, the list of targeted users in each of the data tables 200 and 202 comprises some of the same targeted users. For example, User 7 appears in both data tables 200 and 202. In this example, the second campaign, represented by data table 202, has a higher priority than the first campaign, represented by data table 200.


Referring now to FIG. 4, there is depicted a revised data table 200A for the first campaign. In particular, those targeted users in the second campaign, see data table 202 in FIG. 3, have been suppressed from the first campaign by the e-campaign management program 144 on the server 108. As used herein, the term “suppress” may refer to preventing targeted users from receiving an electronic communication in conjunction with a campaign. Thus, the targeted users appearing in both the data tables 200 and 202, see FIG. 3, will only receive an electronic communication associated with the second campaign, data table 202, since it has been assigned a higher priority level than the first campaign, data table 200.


Once the e-campaign management program 144 has suppressed targeted users from low-level priority campaigns, the e-campaign delivery program 146 on the campaign management server 108 forms and delivers the electronic messages to the targeted users as is known to those skilled in the art. Again, this may include emailing or texting the targeted users with a customized electronic communication.


Referring now to FIG. 5, there is depicted a flow diagram 250 for suppressing a first e-marketing campaign based on a higher priority and second e-marketing campaign pursuant to an illustrative embodiment of the present disclosure. At step 252, an operator of an e-commerce enterprise defines a first e-marketing campaign, including a first target profile. At step 254, a computer server generates a first list of targeted users from a list of users of an e-commerce website based upon the first target profile. At step 256, an operator of an e-commerce enterprise defines a second e-marketing campaign, including a second target profile. At step 258, a computer server generates a second list of targeted users from a list of users of an e-commerce website based upon the second target profile. At step 260, a priority level of the first e-marketing campaign is defined with respect to the second e-marketing campaign. At step 262, those targeted users in the first e-marketing campaign that also appear in the second e-marketing campaign are suppressed from the first e-marketing campaign using a computer server. At step 264, the first e-marketing campaign and the second e-marketing campaign are implemented by forming and delivering electronic messages to the targeted users.


In an illustrative embodiment of the present disclosure, a non-transitory computer readable medium comprises a set of computer readable instructions that, when executed by a processor, cause the processor to perform one or more of the following operations: (i) define a first e-marketing campaign, the first e-marketing campaign comprising a first target user profile, (ii) generate a first data table of targeted users of the e-commerce website based on the first target user profile, (iii) define a second e-marketing campaign, the second e-marketing campaign comprising a second target user profile, (iv) generate a second data table of targeted users of the e-commerce website based on the second target user profile, (v) suppress from the first e-marketing campaign those targeted users in the first data table who also appear in the second data table of the second e-marketing campaign, (vi) define a first message template for the first e-marketing campaign and a second message template for the second e-marketing campaign, (vii) generate and transmit electronic messages to the non-suppressed targeted users in the first e-marketing campaign based on the first message template, (viii) generate and transmit electronic messages to the targeted users in the second e-marketing campaign based on the second message template, and (ix) define a third e-marketing campaign, the third e-marketing campaign comprising a third target user profile and generate a third data table of targeted users of the e-commerce website based on the third target user profile and suppress from the third e-marketing campaign those targeted users in the third data table who also appear in the second data table of the second e-marketing campaign.


In the foregoing Detailed Description, various features of the present disclosure are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed disclosure requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the following claims are hereby incorporated into this Detailed Description of the Disclosure by this reference, with each claim standing on its own as a separate embodiment of the present disclosure.


It is to be understood that the above-described arrangements are only illustrative of the application of the principles of the present disclosure. Numerous modifications and alternative arrangements may be devised by those skilled in the art without departing from the spirit and scope of the present disclosure and the appended claims are intended to cover such modifications and arrangements. Thus, while the present disclosure has been shown in the drawings and described above with particularity and detail, it will be apparent to those of ordinary skill in the art that numerous modifications, including, but not limited to, variations in size, materials, shape, form, function, and manner of operation, assembly, and use may be made without departing from the principles and concepts set forth herein.

Claims
  • 1. A method of creating an e-commerce website facilitating creation of multiple e-marketing campaigns for an e-commerce enterprise, the method comprising: providing the e-commerce website with a web browser program that retrieves, presents and traverses information sources;providing an e-commerce server that hosts the e-commerce website and website and enables e-commerce transactions of products and services via the e-commerce website;providing a data warehouse server comprising a processor coupled to memory, a database management program, and a storage medium, wherein product information is stored on the data warehouse server;providing an e-campaign management server comprising a processor coupled to memory, an e-campaign management program, and an e-campaign delivery program;wherein the e-commerce server, the data warehouse server, and the e-campaign management server are accessible to each other via a network;causing the data management program of the data warehouse server to collect and store data on a plurality of potential targeted users in the storage medium of the data warehouse server;defining a first e-marketing campaign using the e-campaign management program, wherein the e-campaign management program allows the operator to (1) define a first target user profile for target users of the first e-marketing campaign; (2) create a first template for the e-marketing content in the first e-marketing campaign, (3) assign a first priority level to the first e-marketing campaign, (4) assign a first run time to the first e-marketing campaign;causing the e-campaign management program to request data on a plurality of potential targeted users whose profile matches the first target user profile from the data warehouse server, wherein the data warehouse server compares the first target user profile to the data on each potential targeted user to determine users whose profile matches the first target user profile and sends the data on the plurality of potential targeted users whose profile matches the first target user profile to the e-campaign management program on the e-campaign management server;causing the e-campaign management program to generate a first data table of targeted users of the first e-marketing campaign comprising the plurality of potential targeted users whose profile matches the first target user profile and store the first data table of targeted users in a storage medium on the e-campaign management server;causing the e-campaign management server to generate at least one message to each of the targeted users of the first e-marketing campaign, wherein the at least one message is generated by filling in at least one template with e-marketing content and user information for the targeted users of the first e-marketing campaign;defining a second e-marketing campaign using the e-campaign management program, wherein the e-campaign management program allows the operator to (1) define a second target user profile for target users of the second e-marketing campaign; (2) create a second template for the e-marketing content in the second e-marketing campaign, (3) assign a second priority level to the second e-marketing campaign, (4) assign a second run time to the second e-marketing campaign;causing the e-campaign management program to request data on a plurality of potential targeted users whose profile matches the second target user profile from the data warehouse server, wherein the data warehouse server compares the second target user profile to the data on each potential targeted user to determine users whose profile matches the second target user profile and sends the data on the plurality of potential targeted users whose profile matches the second target user profile to the e-campaign management program on the e-campaign management server;causing the e-campaign management program to generate a second data table of targeted users of the second e-marketing campaign comprising the plurality of potential targeted users whose profile matches the first target user profile and store the second data table of targeted users in a storage medium on the e-campaign management server, wherein at least one targeted user appears in both the first data table of targeted users and the second data table of targeted users;causing the e-commerce server to generate at least one message to each of the targeted users of the second e-marketing campaign, wherein the at least one message is generated by filling in at least one template with e-marketing content and user information for the targeted users of the second e-marketing campaign;using the e-campaign management program to define a threshold for the number of communications which a given user may receive in a given period of time;suppressing one or more targeted users of the first and second e-marketing campaigns by removing the targeted users from the first and second data tables if the targeted users received a number of communications greater than the threshold for the number of communications which a given user may receive in a given period of time in the given period of time;comparing the first priority level and the second priority level to determine which of the first e-marketing campaign and the second e-marketing campaign has a lowest priority level;comparing the first priority level and the second priority level to determine which of the first e-marketing campaign and the second e-marketing campaign has a highest priority levelcomparing the first data table of targeted users and the second data table of targeted users using the e-campaign management program and generating a revised data table of targeted users for the determined lowest priority level e-marketing campaign by removing those users in the first data table of targeted users and the second data table of targeted users from the revised data table;implementing the determined highest priority level first e-marketing campaign by causing the e-commerce server to deliver at least one message to the targeted users of the determined highest priority level e-marketing campaign only to the non-suppressed targeted users appearing in the data table of targeted users of related to the determined highest priority level e-marketing campaign; andimplementing the determined lowest priority level e-marketing campaign by causing the e-commerce server to deliver at least one message to the targeted users of the determined lowest priority level e-marketing campaign only to the non-suppressed targeted users appearing in the revised data table related to the determined lowest priority level e-marketing campaign.
  • 2. The method of claim 1, further comprising defining a first message template for the first e-marketing campaign and a second message template for the second e-marketing campaign, the first message template and the second message template including variables.
  • 3. The method of claim 2, wherein said first data table is generated to include data indicated by the variables in the first message template and the second data table is generated to include data indicated by the variables in the second message template.
  • 4. The method of claim 3, further comprising generating and transmitting electronic messages to the non-suppressed targeted users in the first e-marketing campaign based on the first message template.
  • 5. The method of claim 4, further comprising generating and transmitting electronic messages to the targeted users in the second e-marketing campaign based on the second message template.
  • 6. The method of claim 5, wherein the electronic messages to the non-suppressed targeted users in the first e-marketing campaign and to the targeted users in the second e-marketing campaign are delivered using one of email and texting.
  • 7. The method of claim 1, further comprising: defining a third e-marketing campaign using a processor of an e-campaign management server, the third e-marketing campaign comprising a third target user profile;generating a third data table of targeted users of the e-commerce website based on the third target user profile using the processor of the e-campaign management server; andsuppressing from the third e-marketing campaign those targeted users in the third data table who also appear in the second data table of the second e-marketing campaign using the processor of the e-campaign management server.
  • 8. The method of claim 1, further comprising assigning a priority level to the first e-marketing campaign and the second e-marketing campaign using the processor of the e-campaign management server.
  • 9. A system for creating an e-commerce website facilitating creation of multiple e-marketing campaigns for an e-commerce enterprise the system comprising: a processor;a memory coupled to the processor;the e-commerce website including a web browser program that retrieves, presents, and traverses information sources, and an e-commerce management program;an e-commerce server that hosts the e-commerce website and enables e-commerce transactions of products and services via the e-commerce website and the processor;a data warehouse server comprising a processor coupled to memory, a database management program, and a storage medium, wherein product information is stored on the data warehouse server;an e-campaign management server comprising a processor coupled to memory, an e-campaign management program, and an e-campaign delivery program, wherein the e-commerce server, the data warehouse server, and the e-campaign management server are accessible to each other via a network; anda set of computer readable instructions stored in the memory, that when executed by the processor;(I) cause the data warehouse server to collect and store data on a plurality of potential targeted users in the storage medium of the data warehouse server;(ii) define a threshold for a number of communications that a given user may receive in a given period of time;(iii) cause the e-campaign management program to define a first e-marketing campaign by accepting input from a user to (1) define a first target user profile for target users of the first e-marketing campaign; (2) create a first template for the e-marketing content in the first e-marketing campaign, (3) assign a first priority level to the first e-marketing campaign, and (4) assign a first run time to the first e-marketing campaign;(iv) cause the e-campaign management program to request data on a plurality of potential targeted users whose profile matches the first target user profile from the data warehouse server, wherein the data warehouse server compares the first target user profile to the data on each potential targeted user to determine users whose profile matches the first target user profile and sends the data on the plurality of potential targeted users whose profile matches the first target user profile to the e-campaign management program on the e-campaign management server;(v) cause the e-campaign management program to generate a first data table of targeted users of the first e-marketing campaign comprising the plurality of potential targeted users whose profile matches the first target user profile and store the first data table of targeted users in a storage medium on the e-campaign management server;(vi) cause the e-campaign management server to generate at least one message to each of the targeted users of the first e-marketing campaign by combining electronic content and user information of the targeted users of the first e-marketing campaign with the first template for e-marketing content,(vi) (vii) cause the e-campaign management program to define a second e-marketing campaign by accepting input from a user to (1) define a second target user profile for target users of the second e-marketing campaign; (2) create a second template for the e-marketing content in the second e-marketing campaign, (3) assign a second priority level to the second e-marketing campaign, and (4) assign a second run time to the second e-marketing campaign;(viii) cause the e-campaign management program to request data on a plurality of potential targeted users whose profile matches the second target user profile from the data warehouse server, wherein the data warehouse server compares the second target user profile to the data on each potential targeted user to determine users whose profile matches the second target user profile and sends the data on the plurality of potential targeted users whose profile matches the second target user profile to the e-campaign management program on the e-campaign management server;(ix) cause the e-campaign management program to generate a second data table of targeted users of the second e-marketing campaign comprising the plurality of potential targeted users whose profile matches the second target user profile and store the second data table of targeted users in a storage medium on the e-campaign management server, wherein at least one targeted user appears in both the first data table of targeted users and the second data table of targeted users;(x) cause the e-campaign management server to generate at least one message to each of the targeted users of the second e-marketing campaign by combining electronic content and user information of the targeted users of the second e-marketing campaign with the second template for e-marketing content,(xi) cause the e-campaign management server to create a revised first data table and a revised second data table by removing the targeted users from the first and second data tables if the targeted users received a number of communications greater than the threshold for the number of communications which a given user may receive in a given period of time in the given period of time;(xii) cause the e-campaign management server to compare the first priority level and the second priority level to determine which of the first e-marketing campaign and the second e-marketing campaign has a lowest priority level;(xiii) cause the e-campaign management server to compare the first priority level and the second priority level to determine which of the first e-marketing campaign and the second e-marketing campaign has a highest priority level;(x) compare the revised first data table of targeted users and the revised second data table of targeted users and generate a further revised data table of targeted users for the determined lowest priority e-marketing campaign by removing those users in the revised first and revised second data tables of targeted users from the further revised data table;(xi) implement the determined highest priority e-marketing campaign by delivering the at least one message to be sent to the targeted users of the determined highest priority e-marketing campaign only to the non-suppressed targeted users appearing in the revised data table related to the first determined highest priority e-marketing campaign; and(xii) implement the determined lowest priority e-marketing campaign by delivering the at least one message to be sent to the targeted users of the determined lowest priority e-marketing campaign only to the non-suppressed targeted users appearing in the further revised data table related to the determined lowest priority e-marketing campaign.
  • 10. The system of claim 9, wherein the set of computer readable instructions stored in the memory, when executed by the processor, are further operable to cause the processor to perform the operations of: define a first message template for the first e-marketing campaign and a second message template for the second e-marketing campaign.
  • 11. The system of claim 10, wherein the set of computer readable instructions stored in the memory, when executed by the processor, is further operable to cause the processor to perform the operations of: generate and transmit electronic messages to the non-suppressed targeted users in the first e-marketing campaign based on the first message template.
  • 12. The system of claim 11, wherein the set of computer readable instructions stored in the memory, when executed by the processor, is further operable to cause the processor to perform the operations of: generate and transmit electronic messages to the targeted users in the second e-marketing campaign based on the second message template.
  • 13. The system of claim 9, wherein the set of computer readable instructions stored in the memory, when executed by the processor, is further operable to cause the processor to perform the operations of: define a third e-marketing campaign, the third e-marketing campaign comprising a third target user profile;generate a third data table of targeted users of the e-commerce website based on the third target user profile; andsuppress from the third e-marketing campaign those targeted users in the third data table who also appear in the second data table of the second e-marketing campaign.
  • 14. The system of claim 9, wherein the set of computer readable instructions stored in the memory, when executed by the processor, is further operable to cause the processor to perform the operations of: assign a priority level to each of the first e-marketing campaign and the second e-marketing campaign.
  • 15. A non-transitory computer medium for creating an e-commerce website facilitating the creation of multiple e-marketing campaigns for an e-commerce enterprise, the non-transitory computer medium comprising: a web browser program that retrieves, presents, and traverses information sources an e-commerce management program an e-commerce server that hosts the e-commerce website and enables e-commerce transactions of products and services via the e-commerce website;a data warehouse server comprising a processor coupled to memory, a database management program, and a storage medium, wherein product information is stored on the data warehouse server;an e-campaign management server comprising a processor coupled to memory, an e-campaign management program, and an e-campaign delivery program, wherein the e-commerce server, the data warehouse server, and the e-campaign management server are accessible to each other via a networka set of computer readable instructions, that when executed by a processor, cause the processor to perform the operations of:(I) collect and store data on a plurality of potential targeted users on the data warehouse server;(ii) define a threshold for a number of communications that a given user may receive in a given period of time;(iii) define a first e-marketing campaign, the first e-marketing campaign comprising a first target user profile, a first priority level, a first runtime, and a first template for e-marketing content,(iv) generate a first data table of targeted users of the first e-marketing campaign by comparing the first target user profile with the collected data for each potential targeted user stored on the data warehouse server,(v) generate a first message to be sent to the targeted users of the first e-marketing campaign by combining electronic content and user information of the targeted users of the first e-marketing campaign with the first template for e-marketing content,(vi) define a second e-marketing campaign, the second e-marketing campaign comprising a second target user profile, a second priority level, a second runtime and a second template for e-marketing content,(vii) generate a second data table of targeted users of the second e-marketing campaign by comparing the second target user profile with the collected data for each potential targeted user stored on the data warehouse server, wherein at least one targeted user appears in both the first data table of targeted users and the second data table of targeted users,(viii) generate a second message to be sent to the targeted users of the second e-marketing campaign by combining electronic content and user information of the targeted users of the first e-marketing campaign with the first template for e-marketing content,(ix) create a revised first data table and a revised second data table by removing the targeted users from the first and second data tables if the targeted users received a number of communications greater than the threshold for the number of communications which a given user may receive in a given period of time in the given period of time;(x) compare the first priority level and the second priority level to determine which of the first e-marketing campaign and the second e-marketing campaign has a lowest priority level;(xi) compare the first priority level and the second priority level to determine which of the first e-marketing campaign and the second e-marketing campaign has a highest priority level;(xii) compare the data table of targeted users related to the highest determined priority campaign and the data table of targeted users related to the lowest determined priority campaign and generating a further revised data table of targeted users for the second lowest determined priority e-marketing campaign by removing those users in the data tables of targeted users related to both the highest and lowest priority campaigns from the further revised data table;(xiii) implement the determined highest priority e-marketing campaign by delivering the message only to the non-suppressed targeted users appearing in the revised data table related to the determined highest priority e-marketing campaign; and(xiv) implement the determined lowest priority e-marketing campaign by delivering the message only to the non-suppressed targeted users appearing in the further revised data table related to the determined lowest priority e-marketing campaign.
  • 16. The non-transitory computer medium of claim 15, wherein the set of computer readable instructions stored thereon, when executed by the processor, is further operable to cause the processor to perform the operations of: define a first message template for the first e-marketing campaign and a second message template for the second e-marketing campaign.
  • 17. The non-transitory computer medium of claim 16, wherein the set of computer readable instructions stored therein, when executed by the processor, is further operable to cause the processor to perform the operations of: generate and transmit electronic messages to the non-suppressed targeted users in the first e-marketing campaign based on the first message template.
  • 18. The non-transitory computer medium of claim 17, wherein the set of computer readable instructions stored therein, when executed by the processor, is further operable to cause the processor to perform the operations of: generate and transmit electronic messages to the targeted users in the second e-marketing campaign based on the second message template.
  • 19. The non-transitory computer medium of claim 15, wherein the set of computer readable instructions stored therein, when executed by the processor, is further operable to cause the processor to perform the operations of: define a third e-marketing campaign, the third e-marketing campaign comprising a third target user profile;generate a third data table of targeted users of the e-commerce website based on the third target user profile; andsuppress from the third e-marketing campaign those targeted users in the third data table who also appear in the second data table of the second e-marketing campaign.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 13/663,353, filed Oct. 29, 2012, now U.S. Pat. No. 10,949,876, which is hereby incorporated by reference in its entirety.

US Referenced Citations (671)
Number Name Date Kind
3573747 Adams et al. Apr 1971 A
3581072 Nymeyer May 1971 A
4412287 Braddock, III Oct 1983 A
4674044 Kalmus et al. Jun 1987 A
4677552 Sibley, Jr. Jun 1987 A
4789928 Fujisaki Dec 1988 A
4799156 Shavit et al. Jan 1989 A
4808987 Takeda et al. Feb 1989 A
4823265 Nelson Apr 1989 A
4854516 Yamada Aug 1989 A
4903201 Wagner Feb 1990 A
RE33316 Katsuta et al. Aug 1990 E
5027110 Chang et al. Jun 1991 A
5053956 Donald et al. Oct 1991 A
5063507 Lindsey et al. Nov 1991 A
5077665 Silverman et al. Dec 1991 A
5101353 Lupien et al. Mar 1992 A
5136501 Silverman et al. Aug 1992 A
5168446 Wiseman Dec 1992 A
5205200 Wright Apr 1993 A
5243515 Lee Sep 1993 A
5258908 Hartheimer et al. Nov 1993 A
5280422 Moe et al. Jan 1994 A
5297031 Gutterman et al. Mar 1994 A
5297032 Trojan et al. Mar 1994 A
5301350 Rogan et al. Apr 1994 A
5305200 Hartheimer et al. Apr 1994 A
5325297 Bird et al. Jun 1994 A
5329589 Fraser et al. Jul 1994 A
5347632 Filepp et al. Sep 1994 A
5375055 Togher et al. Dec 1994 A
5377354 Scannell Dec 1994 A
5394324 Clearwater Feb 1995 A
5407433 Loomas Apr 1995 A
5411483 Loomas et al. May 1995 A
5426281 Abecassis Jun 1995 A
5485510 Colbert Jan 1996 A
5493677 Balogh et al. Feb 1996 A
5553145 Micali Sep 1996 A
5557728 Garrett et al. Sep 1996 A
5579471 Barber et al. Nov 1996 A
5596994 Bro Jan 1997 A
5598557 Doner et al. Jan 1997 A
5621790 Grossman et al. Apr 1997 A
5640569 Miller et al. Jun 1997 A
5657389 Houvener Aug 1997 A
5664111 Nahan et al. Sep 1997 A
5664115 Fraser Sep 1997 A
5689652 Lupien et al. Nov 1997 A
5694546 Reisman Dec 1997 A
5706457 Dwyer et al. Jan 1998 A
5710889 Clark et al. Jan 1998 A
5715314 Payne et al. Feb 1998 A
5715402 Popolo Feb 1998 A
5717989 Tozzoli et al. Feb 1998 A
5721908 Lagarde et al. Feb 1998 A
5722418 Bro Mar 1998 A
5727165 Ordish et al. Mar 1998 A
5737599 Rowe et al. Apr 1998 A
5760917 Sheridan Jun 1998 A
5761496 Hattori Jun 1998 A
5761655 Hoffman Jun 1998 A
5761662 Dasan Jun 1998 A
5771291 Newton et al. Jun 1998 A
5771380 Tanaka et al. Jun 1998 A
5778367 Wesinger, Jr. et al. Jul 1998 A
5790790 Smith et al. Aug 1998 A
5794216 Brown Aug 1998 A
5794219 Brown Aug 1998 A
5796395 de Hond Aug 1998 A
5799285 Klingman Aug 1998 A
5803500 Mossberg Sep 1998 A
5818914 Fujisaki Oct 1998 A
5826244 Huberman Oct 1998 A
5835896 Fisher et al. Nov 1998 A
5845265 Woolston Dec 1998 A
5845266 Lupien et al. Dec 1998 A
5850442 Muftic Dec 1998 A
5870754 Dimitrova et al. Feb 1999 A
5872848 Romney et al. Feb 1999 A
5873069 Reuhl et al. Feb 1999 A
5873080 Coden et al. Feb 1999 A
5884056 Steele Mar 1999 A
5890138 Godin et al. Mar 1999 A
5890175 Wong et al. Mar 1999 A
5905975 Ausubel May 1999 A
5907547 Foldare et al. May 1999 A
5913215 Rubinstein et al. Jun 1999 A
5922074 Richard et al. Jul 1999 A
5924072 Havens Jul 1999 A
5926794 Fethe Jul 1999 A
5948040 DeLorme et al. Sep 1999 A
5948061 Merriman et al. Sep 1999 A
5956640 Eaton et al. Sep 1999 A
5970490 Morgenstern Oct 1999 A
5974396 Anderson et al. Oct 1999 A
5974412 Hazlehurst et al. Oct 1999 A
5986662 Argiro et al. Nov 1999 A
5987446 Corey et al. Nov 1999 A
5991739 Cupps et al. Nov 1999 A
5999915 Nahan et al. Dec 1999 A
6012053 Pant et al. Jan 2000 A
6029141 Bezos et al. Feb 2000 A
6035288 Solomon Mar 2000 A
6035402 Vaeth et al. Mar 2000 A
6044363 Mori et al. Mar 2000 A
6045447 Yoshizawa et al. Apr 2000 A
6047264 Fisher et al. Apr 2000 A
6049797 Guha et al. Apr 2000 A
6055518 Franklin et al. Apr 2000 A
6058379 Odom et al. May 2000 A
6058417 Hess et al. May 2000 A
6058428 Wang et al. May 2000 A
6061448 Smith et al. May 2000 A
6065041 Lum et al. May 2000 A
6070125 Murphy et al. May 2000 A
6073117 Oyanagi et al. Jun 2000 A
6078914 Redfern Jun 2000 A
6085176 Woolston Jul 2000 A
6104815 Alcorn et al. Aug 2000 A
6119137 Smith et al. Sep 2000 A
6128649 Smith et al. Oct 2000 A
6141010 Hoyle Oct 2000 A
6167382 Sparks et al. Dec 2000 A
6178408 Copple et al. Jan 2001 B1
6185558 Bowman et al. Feb 2001 B1
6192407 Smith et al. Feb 2001 B1
6199077 Inala et al. Mar 2001 B1
6202051 Woolston Mar 2001 B1
6202061 Khosla et al. Mar 2001 B1
6226412 Schwab May 2001 B1
6243691 Fisher et al. Jun 2001 B1
6269238 Iggulden Jul 2001 B1
6271840 Finseth et al. Aug 2001 B1
6275820 Navin-Chandra et al. Aug 2001 B1
6275829 Angiulo et al. Aug 2001 B1
6356879 Aggarwal et al. Mar 2002 B2
6356905 Gershman et al. Mar 2002 B1
6356908 Brown et al. Mar 2002 B1
6366899 Kernz Apr 2002 B1
6370527 Singhal Apr 2002 B1
6373933 Sarkki et al. Apr 2002 B1
6374260 Hoffert et al. Apr 2002 B1
6381510 Amidhozour et al. Apr 2002 B1
6415270 Rackson et al. Jul 2002 B1
6415320 Hess et al. Jul 2002 B1
6434556 Levin et al. Aug 2002 B1
6452609 Katinsky et al. Sep 2002 B1
6456307 Bates et al. Sep 2002 B1
6460020 Pool et al. Oct 2002 B1
6466917 Goyal et al. Oct 2002 B1
6484149 Jammes et al. Nov 2002 B1
6489968 Ortega et al. Dec 2002 B1
6522955 Colborn Feb 2003 B1
6523037 Monahan et al. Feb 2003 B1
6601061 Holt et al. Jul 2003 B1
6604107 Wang Aug 2003 B1
6625764 Dawson Sep 2003 B1
6643696 Davis et al. Nov 2003 B2
6661431 Stuart et al. Dec 2003 B1
6665838 Brown et al. Dec 2003 B1
6675178 Chinchar et al. Jan 2004 B1
6694436 Audebert Feb 2004 B1
6701310 Sugiura et al. Mar 2004 B1
6718536 Dupaquis Apr 2004 B2
6725268 Jacket et al. Apr 2004 B1
6728704 Mao et al. Apr 2004 B2
6732161 Hess et al. May 2004 B1
6732162 Wood et al. May 2004 B1
6785689 Daniel et al. Aug 2004 B1
6801909 Delgado et al. Oct 2004 B2
6856963 Hurwitz Feb 2005 B1
6889054 Himmel et al. May 2005 B2
6907401 Vittal et al. Jun 2005 B1
6912505 Linden et al. Jun 2005 B2
6925307 Mamdani et al. Aug 2005 B1
6978273 Bonneau et al. Dec 2005 B1
7043450 Velez et al. May 2006 B2
7069242 Sheth et al. Jun 2006 B1
7076453 Jammes et al. Jul 2006 B2
7076504 Handel et al. Jul 2006 B1
7080030 Eglen et al. Jul 2006 B2
7099891 Harris et al. Aug 2006 B2
7100111 McElfresh et al. Aug 2006 B2
7100195 Underwood Aug 2006 B1
7117207 Kerschberg et al. Oct 2006 B1
7127416 Tenorio Oct 2006 B1
7165091 Lunenfeld Jan 2007 B2
7167910 Farnham et al. Jan 2007 B2
7216115 Walters et al. May 2007 B1
7240016 Sturgis et al. Jul 2007 B1
7254547 Beck et al. Aug 2007 B1
7305614 Chen et al. Dec 2007 B2
7318037 Solari Jan 2008 B2
7324966 Scheer Jan 2008 B2
7340249 Moran et al. Mar 2008 B2
7349668 Tan et al. Mar 2008 B2
7353188 Yim et al. Apr 2008 B2
7366755 Cuomo et al. Apr 2008 B1
7379890 Myr et al. May 2008 B2
7380217 Gvelesiani May 2008 B2
7383320 Silberstein et al. Jun 2008 B1
7401025 Lokitz Jul 2008 B1
7447646 Agarwal et al. Nov 2008 B1
7451476 Banks et al. Nov 2008 B1
7454464 Puthenkulam et al. Nov 2008 B2
7457730 Degnan Nov 2008 B2
7493521 Li et al. Feb 2009 B1
7496525 Mitchell Feb 2009 B1
7496527 Silverstein et al. Feb 2009 B2
7496582 Farnham et al. Feb 2009 B2
7516094 Perkowski Apr 2009 B2
7539696 Greener et al. May 2009 B1
7546625 Kamangar Jun 2009 B1
7552067 Nephew et al. Jun 2009 B2
7565615 Ebert Jul 2009 B2
7606743 Orzell et al. Oct 2009 B2
7610212 Klett et al. Oct 2009 B2
7653573 Hayes, Jr. et al. Jan 2010 B2
7676484 Fagin Mar 2010 B2
7834883 Adams Nov 2010 B2
7904348 Johnson et al. Mar 2011 B2
7904349 Hart et al. Mar 2011 B1
7912748 Rosenberg et al. Mar 2011 B1
7921031 Crysel et al. Apr 2011 B2
7933818 Kumar et al. Apr 2011 B1
7941751 Ebert May 2011 B2
7979340 MacDonald Korth et al. Jul 2011 B2
7983950 De Vita Jul 2011 B2
7983963 Byrne et al. Jul 2011 B2
7991800 Lawrence et al. Aug 2011 B2
8086643 Tenorio Dec 2011 B1
8095523 Brave et al. Jan 2012 B2
8112303 Eglen et al. Feb 2012 B2
8140989 Cohen et al. Mar 2012 B2
8166155 Rachmeler et al. Apr 2012 B1
8204799 Murray et al. Jun 2012 B1
8214264 Kasavin et al. Jul 2012 B2
8214804 Robertson Jul 2012 B2
8260852 Cselle Sep 2012 B1
8265991 Leffert Sep 2012 B1
8312056 Peng Nov 2012 B1
8326662 Byrne et al. Dec 2012 B1
8359245 Ballaro et al. Jan 2013 B1
8370269 MacDonald-Korth et al. Feb 2013 B2
8370435 Bonefas et al. Feb 2013 B1
8386493 Muni et al. Feb 2013 B2
8392356 Stoner et al. Mar 2013 B2
8452691 MacDonald Korth et al. May 2013 B2
8473316 Panzitta et al. Jun 2013 B1
8494912 Fraser et al. Jul 2013 B2
8498906 Zmolek Jul 2013 B2
8545265 Sakamoto et al. Oct 2013 B2
8566170 Joseph et al. Oct 2013 B1
8577740 Murray et al. Nov 2013 B1
8583480 Byrne Nov 2013 B2
8584149 Crucs Nov 2013 B2
8630960 Gross Jan 2014 B2
8676632 Watson et al. Mar 2014 B1
8693494 Fiatal Apr 2014 B2
8719075 MacDonald Korth et al. May 2014 B2
8793650 Hilerio et al. Jul 2014 B2
8817033 Hur et al. Aug 2014 B2
9047341 Pan Jun 2015 B2
9047642 Byrne et al. Jun 2015 B2
9123069 Haynes et al. Sep 2015 B1
9201558 Dingman et al. Dec 2015 B1
9292361 Chitilian et al. Mar 2016 B1
9418365 Groarke et al. Aug 2016 B2
9430114 Dingman et al. Aug 2016 B1
9448692 Mierau et al. Sep 2016 B1
9483788 Martin Nov 2016 B2
9489681 Barous Nov 2016 B2
9727891 Mezzacca Aug 2017 B2
9741080 Byrne Aug 2017 B1
9747622 Johnson et al. Aug 2017 B1
9805425 MacDonald-Korth et al. Oct 2017 B2
9928752 Byrne et al. Mar 2018 B2
9940659 Behbahani et al. Apr 2018 B1
9954879 Sadaghiani et al. Apr 2018 B1
10013500 McClintock et al. Jul 2018 B1
10074118 Johnson et al. Sep 2018 B1
10102287 Martin Oct 2018 B2
10210518 Alnajem Feb 2019 B2
10217147 Shivaswamy et al. Feb 2019 B2
10269081 Byrne Apr 2019 B1
10423997 MacDonald-Korth et al. Sep 2019 B2
10534845 Noursalehi et al. Jan 2020 B2
10769219 Martin Sep 2020 B1
10810654 Robertson et al. Oct 2020 B1
10853891 MacDonald-Korth et al. Dec 2020 B2
10872350 Hu et al. Dec 2020 B1
10896451 Johnson et al. Jan 2021 B1
10929890 Knab et al. Feb 2021 B2
10949876 Johnson et al. Mar 2021 B2
10970463 Noursalehi et al. Apr 2021 B2
10970742 Knijnik et al. Apr 2021 B1
10970769 Iqbal Apr 2021 B2
10977654 Kumar et al. Apr 2021 B2
11023947 Bosley et al. Jun 2021 B1
11061977 Raskar Jul 2021 B1
11062316 Bizarro et al. Jul 2021 B2
11176598 D'Souza et al. Nov 2021 B2
11205179 Patel et al. Dec 2021 B1
11315145 Knijnik et al. Apr 2022 B1
11463578 De Sanctis et al. Oct 2022 B1
11475484 Knab et al. Oct 2022 B1
11514493 Cook et al. Nov 2022 B1
11526653 Noursalehi et al. Dec 2022 B1
11593811 Hanis et al. Feb 2023 B2
11631124 Robertson et al. Apr 2023 B1
11676192 Moore et al. Jun 2023 B1
11694228 Hu et al. Jul 2023 B1
11734368 Campbell et al. Aug 2023 B1
20010002471 Doish May 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010034667 Petersen Oct 2001 A1
20010034668 Whitworth Oct 2001 A1
20010044751 Pugliese, III et al. Nov 2001 A1
20010047290 Petras et al. Nov 2001 A1
20010047308 Kaminsky et al. Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20020002513 Chiasson Jan 2002 A1
20020007321 Burton Jan 2002 A1
20020007356 Rice et al. Jan 2002 A1
20020013721 Dabbiere et al. Jan 2002 A1
20020019763 Linden et al. Feb 2002 A1
20020022995 Miller et al. Feb 2002 A1
20020023059 Bari et al. Feb 2002 A1
20020026390 Ulenas et al. Feb 2002 A1
20020029187 Meehan et al. Mar 2002 A1
20020038312 Donner et al. Mar 2002 A1
20020040352 McCormick Apr 2002 A1
20020042738 Srinivasan et al. Apr 2002 A1
20020049622 Lettich et al. Apr 2002 A1
20020056044 Andersson May 2002 A1
20020065774 Young et al. May 2002 A1
20020082932 Chinnappan et al. Jun 2002 A1
20020099578 Ficher, Jr. et al. Jul 2002 A1
20020099579 Stowell et al. Jul 2002 A1
20020099602 Moskowitz et al. Jul 2002 A1
20020107718 Morrill et al. Aug 2002 A1
20020107853 Hofmann et al. Aug 2002 A1
20020111826 Potter et al. Aug 2002 A1
20020120537 Morea et al. Aug 2002 A1
20020120609 Lang et al. Aug 2002 A1
20020123957 Notarius et al. Sep 2002 A1
20020124100 Adams Sep 2002 A1
20020129282 Hopkins Sep 2002 A1
20020133502 Rosenthal et al. Sep 2002 A1
20020138399 Hayes et al. Sep 2002 A1
20020147625 Kolke, Jr. Oct 2002 A1
20020156802 Takayama et al. Oct 2002 A1
20020161648 Mason et al. Oct 2002 A1
20020161664 Shaya et al. Oct 2002 A1
20020188777 Kraft et al. Dec 2002 A1
20020194049 Boyd Dec 2002 A1
20020194357 Harris et al. Dec 2002 A1
20020198784 Shaak et al. Dec 2002 A1
20020198882 Linden et al. Dec 2002 A1
20030004855 Dutta et al. Jan 2003 A1
20030005046 Kavanagh et al. Jan 2003 A1
20030007464 Balani Jan 2003 A1
20030009362 Cifani et al. Jan 2003 A1
20030009392 Perkowski Jan 2003 A1
20030014400 Siegel Jan 2003 A1
20030028451 Ananian Feb 2003 A1
20030028605 Millett et al. Feb 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030035138 Schilling Feb 2003 A1
20030036914 Fitzpatrick et al. Feb 2003 A1
20030040970 Miller Feb 2003 A1
20030041008 Grey et al. Feb 2003 A1
20030046149 Wong Mar 2003 A1
20030069740 Zeidman Apr 2003 A1
20030069790 Kane Apr 2003 A1
20030069825 Hoffman et al. Apr 2003 A1
20030083961 Bezos et al. May 2003 A1
20030088467 Culver May 2003 A1
20030088511 Korboulonis et al. May 2003 A1
20030093331 Childs et al. May 2003 A1
20030097352 Gutta et al. May 2003 A1
20030105682 Dicker et al. Jun 2003 A1
20030110100 Wirth, Jr. Jun 2003 A1
20030119492 Timmins et al. Jun 2003 A1
20030131095 Kumhyr et al. Jul 2003 A1
20030139969 Scroggie et al. Jul 2003 A1
20030140007 Kramer et al. Jul 2003 A1
20030140121 Adams Jul 2003 A1
20030158792 Perkowski Aug 2003 A1
20030163340 Fitzpatrick et al. Aug 2003 A1
20030167213 Jammes et al. Sep 2003 A1
20030167222 Mehrotra et al. Sep 2003 A1
20030177103 Ivanov et al. Sep 2003 A1
20030187745 Hobday et al. Oct 2003 A1
20030200156 Roseman et al. Oct 2003 A1
20030204449 Kotas et al. Oct 2003 A1
20030217002 Enborg Nov 2003 A1
20030220835 Barnes, Jr. Nov 2003 A1
20040006509 Mannik et al. Jan 2004 A1
20040015416 Foster et al. Jan 2004 A1
20040029567 Timmins et al. Feb 2004 A1
20040041836 Zaner et al. Mar 2004 A1
20040044563 Stein Mar 2004 A1
20040055017 Delpuch et al. Mar 2004 A1
20040058710 Timmins et al. Mar 2004 A1
20040073476 Donahue et al. Apr 2004 A1
20040078388 Melman Apr 2004 A1
20040093311 Chew et al. May 2004 A1
20040107136 Nemirofsky et al. Jun 2004 A1
20040117242 Conrad et al. Jun 2004 A1
20040122083 Pettit et al. Jun 2004 A1
20040122681 Ruvolo et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040122855 Ruvolo et al. Jun 2004 A1
20040128183 Challey et al. Jul 2004 A1
20040128283 Wang et al. Jul 2004 A1
20040128320 Grove et al. Jul 2004 A1
20040143731 Audebert et al. Jul 2004 A1
20040148232 Fushimi et al. Jul 2004 A1
20040172323 Stamm Sep 2004 A1
20040172379 Mott et al. Sep 2004 A1
20040174979 Hutton et al. Sep 2004 A1
20040186766 Fellenstein et al. Sep 2004 A1
20040199496 Liu et al. Oct 2004 A1
20040199905 Fagin et al. Oct 2004 A1
20040204989 Dicker Oct 2004 A1
20040204991 Monahan et al. Oct 2004 A1
20040230989 Macey et al. Nov 2004 A1
20040240642 Crandell et al. Dec 2004 A1
20040249727 Cook Jr. et al. Dec 2004 A1
20040267717 Slackman Dec 2004 A1
20050002166 Dinnage et al. Jan 2005 A1
20050010925 Khawand et al. Jan 2005 A1
20050038733 Foster et al. Feb 2005 A1
20050044254 Smith Feb 2005 A1
20050055306 Miller et al. Mar 2005 A1
20050060664 Rogers Mar 2005 A1
20050097204 Horowitz et al. May 2005 A1
20050114229 Ackley et al. May 2005 A1
20050120311 Thrall Jun 2005 A1
20050131837 Sanctis et al. Jun 2005 A1
20050144064 Calabria et al. Jun 2005 A1
20050144074 Fredregill et al. Jun 2005 A1
20050193333 Ebert Sep 2005 A1
20050197846 Pezaris et al. Sep 2005 A1
20050197950 Moya et al. Sep 2005 A1
20050198031 Pezaris et al. Sep 2005 A1
20050202390 Allen et al. Sep 2005 A1
20050203888 Woosley et al. Sep 2005 A1
20050216300 Appelman et al. Sep 2005 A1
20050240474 Li Oct 2005 A1
20050262067 Lee et al. Nov 2005 A1
20050273378 MacDonald-Korth et al. Dec 2005 A1
20050278231 Teeter Dec 2005 A1
20060009994 Hogg et al. Jan 2006 A1
20060010105 Sarakkai et al. Jan 2006 A1
20060015498 Sarmiento et al. Jan 2006 A1
20060031240 Eyal et al. Feb 2006 A1
20060041638 Whittaker et al. Feb 2006 A1
20060048093 Jain et al. Mar 2006 A1
20060058048 Kapoor et al. Mar 2006 A1
20060069623 MacDonald Korth et al. Mar 2006 A1
20060085251 Greene Apr 2006 A1
20060173817 Chowdhury et al. Aug 2006 A1
20060206386 Walker et al. Sep 2006 A1
20060206479 Mason Sep 2006 A1
20060212358 Walker et al. Sep 2006 A1
20060218049 Walker et al. Sep 2006 A1
20060224470 Garcia Ruano et al. Oct 2006 A1
20060230035 Bailey et al. Oct 2006 A1
20060235752 Kavanagh et al. Oct 2006 A1
20060253476 Roth et al. Nov 2006 A1
20060259360 Flinn et al. Nov 2006 A1
20060271671 Hansen Nov 2006 A1
20060282304 Bedard et al. Dec 2006 A1
20070005424 Arauz Jan 2007 A1
20070027760 Collins et al. Feb 2007 A1
20070027814 Touriniemi Feb 2007 A1
20070055568 Osborne Mar 2007 A1
20070073641 Perry et al. Mar 2007 A1
20070077025 Mino Apr 2007 A1
20070078726 MacDonald Korth et al. Apr 2007 A1
20070078849 Slothouber Apr 2007 A1
20070083437 Hamor Apr 2007 A1
20070094597 Rostom Apr 2007 A1
20070100803 Cava May 2007 A1
20070130090 Staib et al. Jun 2007 A1
20070160345 Sakai et al. Jul 2007 A1
20070162379 Skinner Jul 2007 A1
20070174108 Monster Jul 2007 A1
20070192168 Van Luchene Aug 2007 A1
20070192181 Asdourian Aug 2007 A1
20070206606 Coleman et al. Sep 2007 A1
20070214048 Chan et al. Sep 2007 A1
20070226679 Jayamohan et al. Sep 2007 A1
20070233565 Herzog et al. Oct 2007 A1
20070239534 Liu et al. Oct 2007 A1
20070245013 Saraswathy et al. Oct 2007 A1
20070260520 Jha et al. Nov 2007 A1
20070282666 Afeyan et al. Dec 2007 A1
20070288298 Gutierrez Dec 2007 A1
20070299743 Staib et al. Dec 2007 A1
20080010678 Burdette et al. Jan 2008 A1
20080015938 Haddad et al. Jan 2008 A1
20080021763 Merchant Jan 2008 A1
20080052152 Yufik Feb 2008 A1
20080071640 Nguyen Mar 2008 A1
20080082394 Floyd et al. Apr 2008 A1
20080103893 Nagarajan et al. May 2008 A1
20080120342 Reed et al. May 2008 A1
20080126205 Evans et al. May 2008 A1
20080126476 Nicholas et al. May 2008 A1
20080133305 Yates et al. Jun 2008 A1
20080133349 Nazer et al. Jun 2008 A1
20080140765 Kelaita et al. Jun 2008 A1
20080162574 Gilbert Jul 2008 A1
20080195476 Marchese et al. Aug 2008 A1
20080201218 Broder et al. Aug 2008 A1
20080215456 West et al. Sep 2008 A1
20080281714 Kluth Nov 2008 A1
20080288338 Wiseman et al. Nov 2008 A1
20080294536 Taylor et al. Nov 2008 A1
20080300909 Rikhtverchik et al. Dec 2008 A1
20080301009 Plaster et al. Dec 2008 A1
20080305869 Konforty et al. Dec 2008 A1
20080313010 Jepson et al. Dec 2008 A1
20080320012 Loving et al. Dec 2008 A1
20090006190 Lucash et al. Jan 2009 A1
20090006315 Mukherjea et al. Jan 2009 A1
20090030755 Altberg et al. Jan 2009 A1
20090030775 Vieri Jan 2009 A1
20090037355 Brave et al. Feb 2009 A1
20090106080 Carrier et al. Apr 2009 A1
20090106127 Purdy et al. Apr 2009 A1
20090110181 Koenig et al. Apr 2009 A1
20090119167 Kendall et al. May 2009 A1
20090157537 Miller Jun 2009 A1
20090164323 Byrne Jun 2009 A1
20090164442 Shani et al. Jun 2009 A1
20090182589 Kendall et al. Jul 2009 A1
20090204848 Kube et al. Aug 2009 A1
20090222337 Sergiades Sep 2009 A1
20090222348 Ransom et al. Sep 2009 A1
20090222737 Liesche et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234722 Evevsky Sep 2009 A1
20090240582 Sheldon-Neal et al. Sep 2009 A1
20090276284 Yost Nov 2009 A1
20090276305 Clopp Nov 2009 A1
20090292677 Kim Nov 2009 A1
20090293019 Raffel et al. Nov 2009 A1
20090313173 Singh et al. Dec 2009 A1
20100042684 Broms et al. Feb 2010 A1
20100070448 Omoigui Mar 2010 A1
20100076816 Phillips Mar 2010 A1
20100076851 Jewell, Jr. Mar 2010 A1
20100094673 Lobo et al. Apr 2010 A1
20100107123 Sareen et al. Apr 2010 A1
20100145831 Esfandiari et al. Jun 2010 A1
20100146413 Yu Jun 2010 A1
20100174754 B'Far et al. Jul 2010 A1
20100228617 Ransom et al. Sep 2010 A1
20100274821 Bernstein et al. Oct 2010 A1
20110010656 Mokotov Jan 2011 A1
20110035276 Ghosh et al. Feb 2011 A1
20110055054 Glasson Mar 2011 A1
20110060621 Weller et al. Mar 2011 A1
20110103699 Ke et al. May 2011 A1
20110131253 Peukert et al. Jun 2011 A1
20110137973 Wei et al. Jun 2011 A1
20110145226 Gollapudi et al. Jun 2011 A1
20110153383 Bhattacharjya et al. Jun 2011 A1
20110153663 Koren et al. Jun 2011 A1
20110173076 Eggleston et al. Jul 2011 A1
20110191319 Nie et al. Aug 2011 A1
20110196802 Ellis et al. Aug 2011 A1
20110225050 Varghese Sep 2011 A1
20110231226 Golden Sep 2011 A1
20110231383 Smyth et al. Sep 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110271204 Jones et al. Nov 2011 A1
20110276513 Erhart et al. Nov 2011 A1
20110289068 Teevan et al. Nov 2011 A1
20120005187 Chavanne Jan 2012 A1
20120030067 Pothukuchi et al. Feb 2012 A1
20120084135 Nissan et al. Apr 2012 A1
20120089454 Chen Apr 2012 A1
20120123899 Wiesner May 2012 A1
20120158480 Sundaram Jun 2012 A1
20120158715 Maghoul et al. Jun 2012 A1
20120164619 Meer Jun 2012 A1
20120166299 Heinstein et al. Jun 2012 A1
20120203723 Huang et al. Aug 2012 A1
20120231424 Calman et al. Sep 2012 A1
20120233312 Ramakumar et al. Sep 2012 A1
20120239504 Curlander et al. Sep 2012 A1
20120253985 Maron et al. Oct 2012 A1
20120271702 MacLachlan et al. Oct 2012 A1
20120278388 Kleinbart et al. Nov 2012 A1
20120284336 Schmidt et al. Nov 2012 A1
20120296697 Kumar Nov 2012 A1
20120323674 Simmons et al. Dec 2012 A1
20120323725 Johnston et al. Dec 2012 A1
20130031470 Daly, Jr. et al. Jan 2013 A1
20130073392 Allen et al. Mar 2013 A1
20130080200 Connolly et al. Mar 2013 A1
20130080426 Chen et al. Mar 2013 A1
20130085893 Bhardwaj et al. Apr 2013 A1
20130144870 Gupta et al. Jun 2013 A1
20130145254 Masuko et al. Jun 2013 A1
20130151331 Avner et al. Jun 2013 A1
20130151388 Falkenborg et al. Jun 2013 A1
20130173408 Lindblom Jul 2013 A1
20130185164 Pottjegort Jul 2013 A1
20130191409 Zeng et al. Jul 2013 A1
20130246300 Fischer et al. Sep 2013 A1
20130254059 Teo Sep 2013 A1
20130268561 Christie et al. Oct 2013 A1
20140019298 Suchet et al. Jan 2014 A1
20140019313 Hu et al. Jan 2014 A1
20140019542 Rao et al. Jan 2014 A1
20140025509 Reisz et al. Jan 2014 A1
20140032544 Mathieu et al. Jan 2014 A1
20140095273 Tang et al. Apr 2014 A1
20140114680 Mills et al. Apr 2014 A1
20140114755 Mezzacca Apr 2014 A1
20140136290 Schiestl et al. May 2014 A1
20140172652 Pobbathi et al. Jun 2014 A1
20140180758 Agarwal et al. Jun 2014 A1
20140200959 Sarb et al. Jul 2014 A1
20140259056 Grusd Sep 2014 A1
20140278880 Emphers et al. Sep 2014 A1
20140279191 Agarwal et al. Sep 2014 A1
20140289005 Laing et al. Sep 2014 A1
20140310094 Shapira et al. Oct 2014 A1
20140330818 Raina et al. Nov 2014 A1
20140337090 Tavares Nov 2014 A1
20140372415 Fernandez-Ruis Dec 2014 A1
20150019958 Ying et al. Jan 2015 A1
20150032507 Narasimhan et al. Jan 2015 A1
20150088695 Lorbiecki et al. Mar 2015 A1
20150088968 Wei et al. Mar 2015 A1
20150089524 Cremonesi et al. Mar 2015 A1
20150106181 Kluth Apr 2015 A1
20150142543 Lellouche May 2015 A1
20150286742 Zhang et al. Oct 2015 A1
20150287066 Wortley et al. Oct 2015 A1
20160071105 Groarke et al. Mar 2016 A1
20160098488 Battle et al. Apr 2016 A1
20170076324 Waldron Mar 2017 A1
20170228375 Yang et al. Aug 2017 A1
20170235788 Borisyuk et al. Aug 2017 A1
20170300911 Alnajem Oct 2017 A1
20170344622 Islam et al. Nov 2017 A1
20170358000 Jain et al. Dec 2017 A1
20180033064 Varley Feb 2018 A1
20180167412 Barrett et al. Jun 2018 A1
20190043106 Talmor et al. Feb 2019 A1
20190066111 Bizarro et al. Feb 2019 A1
20190130904 Homma et al. May 2019 A1
20190197550 Sharma Jun 2019 A1
20190295088 Jia et al. Sep 2019 A1
20190325868 Lecue et al. Oct 2019 A1
20200005310 Kumar et al. Jan 2020 A1
20200065357 Noursalehi et al. Feb 2020 A1
20200184540 D'Souza et al. Jun 2020 A1
20200218766 Yaseen et al. Jul 2020 A1
20200250675 Hanis et al. Aug 2020 A1
20200293587 Ayers et al. Sep 2020 A1
20200410552 Stohlman Dec 2020 A1
Foreign Referenced Citations (27)
Number Date Country
2253543 Mar 1997 CA
2347812 May 2000 CA
0636993 Apr 1999 EP
0807891 May 2000 EP
1241603 Sep 2002 EP
2397400 Jul 2004 GB
2424098 Sep 2006 GB
2001283083 Dec 2001 JP
2002318935 Oct 2002 JP
2007021920 Feb 2007 JP
2009505238 Feb 2009 JP
WO1997017663 May 1997 WO
WO1998032289 Jul 1998 WO
WO1998047082 Oct 1998 WO
WO1998049641 Nov 1998 WO
WO1999059283 Nov 1999 WO
WO2000025218 May 2000 WO
WO20000068851 Nov 2000 WO
WO2001009803 Feb 2001 WO
WO2001082135 Nov 2001 WO
WO2001097099 Dec 2001 WO
WO2002037234 May 2002 WO
WO2003094080 Nov 2003 WO
WO2007021920 Feb 2007 WO
WO2012093410 Jul 2012 WO
WO2015116038 Aug 2015 WO
WO2015176071 Nov 2015 WO
Non-Patent Literature Citations (123)
Entry
Teo, “Organizational Factors of Success in Using EDIS: A Survey of Tradenet Participants,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Tjostheim et al., “A case study of an on-line auction for the World Wide Web,” printed from www.nr.no/gem/elcom/puplikasjoner/enter98e.html on Jun. 10, 1990, 10 pages.
Turban, “Auctions and Bidding on the Internet: An Assessment,” Electronic Markets—The International Journal, Dec. 1997, 5 pages, vol. 7, No. 4.
ubid.com, “How do I Updated my Address, Phone, Credit Card, Password, etc.? ” printed from web.archive.org/web/20010208113903/www.ubid.com/help/topic13asp on Aug. 30, 2007.
ubid.com, “How do I track my shipment?” printed from web.archive.org/web/20010331032659/www.ubid.com/help/topic27.asp on Aug. 30, 2007.
ubid.com, “Can I track all of my bids from My Page?” printed from web.archive.org/web/20010208114049/www.ubid.com/help/topic14.asp on Aug. 30, 2007.
Van Heck et al., “Experiences with Electronic Auctions in the Dutch Flower Industry,” Electronic Markets—The International Journal, Dec. 1997, 6 pages, vol. 7, No. 4.
Verizon Wireless, “Verizon Wireless Customers Get It NowSM; Get Games, Get Pix, Get Ring Tones and Get Going in Full Color,” press release to PRNEWSWIRE, Sep. 23, 2002.
Warbelow et al., “AUCNET: TV Auction Network System,” Harvard Business School 9-190-001, Jul. 19, 1989, Rev. Apr. 12, 1996, pp. 1-15.
Weber, “How Financial Markets are Going On-line,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Wireless Internet, “DailyShopper Selects 2Roam to Enable Mobile Customers to Retrieve Nearby Sales and Promotions Information,” Wireless Internet, Apr. 2001.
Wireless Week, “Verizon Wireless Gets Going on BREW Agenda,” Wireless Week, Sep. 23, 2002.
xchanger.net, webpage printed from www.auctiva.com/showcases/as_4sale.asp?uid=exchanger, undated but at least as early as Oct. 12, 2000.
Yu et al., “Distributed Reputation Management for Electronic Commerce,” Computational Intelligence, 2002, pp. 535-549, vol. 18, No. 4.
Zetmeir, Auction Incentive Marketing, print of all pages of website found at home.earthlink.net/˜bidpointz/ made Oct. 8, 2004.
Zimmermann, “Integration of Financial Services: The TeleCounter,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Zwass, “Electronic Commerce: Structures and Issues,” International Journal of Electronic Commerce, Fall 1996, pp. 3-23, vol. 1, No. 1.
MESSAGE Passing from Wikipedia, archived May 6, 2016, retrieved from https://en.wikipedia.org/wiki/message_passing, 4 pages.
Di et al., “A New Implementation for Ontology Mapping Based enterprise Semantic Interoperation,” by Xiaofeng Di and Yushun Fan, Applied Mechanics and Materials, vols. 16-19 (2009), pp. 644-648 (Year:2009).
Nicolle et a., “XML Integration and Toolkit for B2B Applications,” by Christophe Nicolle, Kokou Yetongnon, and Jean-Claude Simon, Journal of Database Management, Oct.-Dec. 2003 (Year: 2003).
V. Aksakalli, Optimizing direct response in Internet display advertising, Elsevier, vol. 11, Issue 3, May-Jun. 2012, pp. 229-240. (Year: 2012).
Gallagher et al. A framework for targeting banner advertising on the internet. IEEE, pp. 265-274 (Year: 1997).
Alex, Neil, “Optimizing Search Results in Elasticsearch with Scoring and Boosting”, Mar. 18, 2015, Qbox.io, accessed at [https://qbox.io/blog/optimizing-search-results-in-elasticsearch0with-scoring-and-boosting] (year: 2015).
Hybrid algorithms for recommending new items. Cremonesi et al., ResearchGate, Google, (year:2011).
Lee, “AUCNET: Electronic Intermediary for Used-Car Transactions,” Electronic Market—The International Journal, Dec. 1997, pp. 24-28, vol. 7, No. 4.
T.Y. Lee, S. Li and R. Wei, “Needs-Centric Searching and Ranking Based on Customer Reviews,” 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services, Washington, DC, 2008, pp. 128-135. (Year: 2008).
Levy, Michael, and Dhruv Grewal. “Supply chain management in a networked economy.” Journal Retailing 76.4 (2000): 415-429.
Live365 press release, “Live365 to Offer Opt-In Advertising on Its Website,” Oct. 15, 2004.
London Business School, “Overture and Google: Internet Pay-Per-Click (PPC) Advertising Options,” Mar. 2003.
M2 Presswire, “Palm, Inc.: Palm unveils new web browser optimised for handhelds; HTML browser offers high-speed web-browsing option,” Mar. 13, 2002.
Malone et al., “Electronic Markets and Electronic Hierarchies,” Communications of the ACM, Jun. 1987, pp. 484-497, vol. 30, No. 6.
Mansell et al., “Electronic Trading Networks: The Route to Competitive Advantage?” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Mardesich, “Onsale takes auction gavel electronic,” Computer Reseller News, Jul. 8, 1996, pp. 2, 32.
Marteau, “Shop with One Click, Anywhere, Anytime,” Information Management and Consulting, 2000, pp. 44-46, vol. 15, No. 4.
Massimb et al., “Electronic Trading, Market Structure and Liquidity,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 39-49.
McGinnity, “Build Your Weapon,” PC Magazine, Apr. 24, 2011, printed from www.pcmag.com/print_article2?0,1217,a%253D3955,00.asp.
Meade, “Visual 360: a performance appraisal system that's ‘fun,’” HR Magazine, 44, 7, 118(3), Jul. 1999.
“Mediappraise: Mediappraise Receives National Award for Web-Based Technology That Enables Companies to Solve Thorny HR Problem,” Dec. 14, 1998.
Medvinsky et al., “Electronic Currency for the Internet,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
metails.com, www.metails.com homepage, printed Oct. 13, 2004.
Microsoft Computer Dictionary, Fifth Edition, front matter and p. 33.
Microsoft Computer Dictionary, Fifth Edition, front matter, back matter, and pp. 479, 486.
Neches, “FAST—A Research Project in Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 4 pages, vol. 3., No. 3.
Neisser, “Which is better for Social Media Monitoring: TweetDeck or SproutSocial” Mar. 17, 2011, Social Media Examiner, https://www.socialmediaexaminer.com/which-is-better-for-social-media-monitoring-tweetdeck-or-sproutsocial/.
Neo, “The implementation of an electronic market for pig trading in Singapore,” Journal of Strategic Information Systems, Dec. 1992, pp. 278-288, vol. 1, No. 5.
O'Mahony, “An X.500-based Product Catalogue,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
“ONSALE: ONSALE Brings Thrill of Auctions and Bargain Hunting Online: Unique Internet retail services debuts with week-long charity auction for the Computer Museum in Boston,” May 24, 1995, printed from www.dialogweb.com/cgi/dwclient?dwcommand,DWEBPRINT%20810-489267.
“ONSALE joins fray as online shopping pcks up speed: Internet Booms,” Comptuer Reseller News, Jun. 5, 1995.
Palm, Inc., PalmTM Web Pro Handbook, copyright 2002-2003.
Post et al., “Application of Auctions as a Pricing Mechanism for the Interchange of Electric Power,” IEEE Transactions of Power Systems, Aug. 1995, pp. 1580-1584, vol. 10, No. 3.
Preist et al., “Adaptive agents in a persistent shout double auction,” International Conference on Information and Computation, Proceedings of the first international conference on information and computation economies, Oct. 25-28, 1998, Charleston, United States, pp. 11-18.
Qualcomm, “Brew Developer Support,” printed from web.archive.org/web/20020209194207/http://www.qualcomm.com/brew/developer/support/kb/52.html on Aug. 30, 2007.
RCR Wireless News, “Lockheed Martin to use 2Roam's technology for wireless platform,” RCR Wireless News, Sep. 10, 2001.
Reck, “Formally Specifying an Automated Trade Execution System,” J. Systems Software, 1993, pp. 245-252, vol. 21.
Reck, “Trading-Process Characteristics of Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, pp. 17-23, vol. 7, No. 4.
repcheck.com, www.repcheck.com homepage, printed from web.archive.org/web/20020330183132/http://repcheck.com on Sep. 5, 2009.
Resnick et al., “Reputation Systems,” Communications of the ACM, Dec. 2000, pp. 45-48, vol. 43, No. 12.
Rockoff et al., “Design of an Internet-based system for remote Dutch auctions,” Internet Research: Electronic Networking Applications and Policy, 1995, pp. 10-16, vol. 5, No. 4.
Rodriguez, Camille, HootSuite vs. social Oomph vs. Tweekdeck, Jan. 4, 2012, http://polkadotimpressions.com/2012/01/04/hootsuite-vs-social-oopmphvs.tweetdeck/ (Year: 2012).
Rose, “Vendors strive to undo Adobe lock-hold,” Computer Reseller News, Feb. 5, 1996, n 66669, p. 71(7).
Ross, David Frederick, Frederick S. Weston, and W. Stephen. Introduction to supply chain management technologies. CRC Press, 2010.
Rysavy, “Mobile-commerce ASPs do the legwork,” Network Computing, Jan. 22, 2001, p. 71, 6 pgs., vol. 12, No. 2.
Saunders, “AdFlight to Offer WAP Ads,” Oct. 17, 2000, printed from clickz.com/487531/print.
Schaffer, Neil, The Top 20 Twitter clients—HootSuite, TweetDeck and More, Jan. 31, 2012, https://maximizesocialbusinss.com/top-20-twitter-clients-2012-9175/ (Year: 2012).
Schmid, “Electronic Markets,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Schwankert, “Matsushita Taps 2Roam for Wireless Solutions,” www.internetnews.com/bus-news.article.php/674811, Feb. 2, 2001.
Sen, “Inventory and Pricing Models for Perishable Products,” Doctor of Philosophy Dissertation—University of Southern California, Aug. 2000.
Siegmann, “Nowhere to go but up,” PC Week, Oct. 23, 1995, 3 pages, vol. 12, No. 42.
Telephony Staff, “Air-ASP,” Telephony Online, Oct. 2, 2000, 3 pages.
2Roam, Inc., multiple archived pages of www.2roam.com retrieved via Internet Archive Wayback Machine on Jun. 10, 2008.
Alt et al., “Bibliography on Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 5 pages, vol. 3, No. 3.
Alt et al., “Computer Integrated Logistics,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 1, No. 3.
Anonymous, Image manipulation (image editing software and image-manipulation systems)(Seybold Special Report, Part II), Seybold Report on Publishing Systems, May 15, 1995, p. S35(9), vol. 24, No. 18.
auctionwatch.com, multiple pages—including search results for “expedition,” printed Apr. 21, 2011.
auctiva.com, multiple pages, undated but website copyright date is “1999-2000.”
Ball et al., “Supply chain infrastructures: system integration and information sharing,” ACM SIGMOD Record, 2002, vol. 31, No. 1, pp. 61-66.
Berger et al., “Random Ultiple-Access Communication and Group Testing,” IEEE, 1984.
Braganza, “Is Resarch at Cranfield—A Look at the Future,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Brecht et al., “The IM 2000 Research Programme,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Business Wire business/technology editors, “Sellers Flock to OutletZoo.com as New Automatic Price Drop Method Moves Excess Inventory Online,” Business Wire, Oct. 25, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Expands in Real Estate Market with Adoption of Rimfire on REALTOR.com,” Business Wire, Nov. 8, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Shows Strong Revenue Growth in Internet Imaging Business,” Business Wire, Nov. 10, 1999.
Business Wire business editors/high-tech writers, “2Roam Partners with Pumatech to Delivery Wireless Alerts,” Business Wire, Dec. 18, 2000.
Business Wire business editors/high-tech writers, “2Roam Takes eHow's How-to Solutions Wireless: With 2Roam, the Web's One-Stop Source for getting Things Done is on More Wireless Devices, with Ability to Purchase Its Products from Anywhere,” Business Wire, Oct. 2, 2000.
Business Wire business editors/high-tech writers, “2Roam Drives Hertz to the Wireless Web: No. One Car Rental Company to Provide Customers Wireless Access from Any Device, ” Business Wire, Aug. 7, 2001.
buy.com, www.buy.com homepage, printed Oct. 13, 2004.
Chen et al., “Detecting Web Page Structure for Adaptive Viewing on Small Form Factor Devices,” ACM, May 20-24, 2003.
Chen, M. (2007). Knowledge assisted data management and retrieval in multimedia database systems (Order No. 3268643).
Y.K. Choi and S. K. Kim, “An auxillary reccomendation system for repetitively purchasing items in E-commerce,” 2014 International Conference on Big Data and Smart Computing (BIGCOMP), Bangkok, 2014, pp. 96-98. (Year 2014).
Clarke, “Research Programme in Supra-organizational Systems,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Clemons et al., “Evaluating the prospects for alternative electronic securities markets,” Proceedings of the twelfth International conference on information systems, New York, New York, United States, pp. 53-64, 1991.
Fan, J., Keim, F.A., Gao, Y., Luo, H. and Li, Z. (2009). JustClick: Personalized Image Recommendation via Exploratory Search from Large-Scale Flickr Images. Feb. 2009. IEEE Transactions on Circuits and Systems for Video Technology, 19(2), pp. 2730288. (Year: 2009).
friendster.com, homepage and “more info” pages, printed Apr. 29, 2004.
Google News archive search for “2Roam marketing” performed over the date range 2000-2003.
Google News archive search for “2Roam SMS” performed over the date range 2000-2008.
Grabowski et al., “Mobile-enabled grid middleware and/or grid gateways,” GridLab—A Grid Application Toolkit and Testbed, Work Package 12—Access for Mobile Users, Jun. 3, 2003.
Graham, “The Emergence of Linked Fish Markets in Europe,” Electronic Markets—The International Journal, Jul. 1993, 4 pages, vol. 8, No. 2.
Gunthorpe et al., “Portfolio Composition and the Investment Horizon,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 51-56.
Halperin, “Toward a Process Handbook for Organizational Coordination Processes,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Hess et al., “Computerized Loan Origination Systems: An Industry Case Study of the Electronic Markets Hypothesis,” MIS Quarterly, Sep. 1994, pp. 251-275.
IBM, “Anyonymous Delivery of Goods in Electronic Commerce,” IBM Technical Disclosure Bulletin, Mar. 1996, pp. 363-366, vol. 39, No. 3.
IBM, “Personal Optimized Decision/Transaction Program,” IBM Technical Disclosure Bulletin, Jan. 1995, pp. 83-84, vol. 38, No. 1.
ICROSSING, “ICROSSING Search Synergy: Natural & Paid Search Symbiosis,” Mar. 2007.
IEEE 100—The Authoritative Dictionary of IEEE Standard Terms, Seventh Edition, 2000. Entire book cited; table of contents, source list, and terms beginning with A included. ISBN 0-7381-2601-2a.
Ives et al., “Editor's Comments—MISQ Central: Creating a New Intellectual Infrastructure,” MIS Quarterly, Sep. 1994, p. xxxv.
Joshi, “Information visibility and its effect on supply chain dynamics,” Ph.D. dissertation, Massachusetts Institute of Technology, 2000 (fig. 4.5; p. 45).
Klein, “Information Logistics,” Electronic Markets—The International Journal, Oct. 1993, pp. 11-12, vol. 3, No. 3.
Klein, “Introduction to Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, 4 pages, vol. 7, No. 4.
Kubicek, “The Organization Gap,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
S. Kulkarni, A. M. Sankpal, R.R. Mudholkar and Kirankumari, “Recommendation engine: Matching individual/group profiles for better shopping experience,” 2013 15th International Conference on Advanced Computing Technologies (ICACT), Rajampet, 2013, pp. 1-6. (Year: 2013).
Kuula, “Telematic Services in Finland,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lalonde, “The EDI World Institute: An International Approach,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lee et al., “Intelligent Electronic Trading for Commodity Exchanges,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Lee et al., “Electronic Brokerage and Electronic Auction: The Impact of IT on Market Structures,” Proceedings of the 29th Annual Hawaii International Conference on System Sciences, 1996, pp. 397-406.
Dubinsky, B., “Uncovering accounts payable fraud by using ‘fuzzy matching logic’: Part 1,” Business Credit 110.3:6 (4), National Association of Credit Management, Mar. 2008, (Year: 2008).
Dubinsky, B., “Uncovering accounts payable fraud by using ‘fuzzy matching logic’: Part 2,” Business Credit 110.4: 64 (3), National Association of Credit Management, Apr. 2008 (Year:2008).
Qureshi et al. “Taxonomy based Data Marts,” by Asiya Abdus Salam Qureshi and Syed Muhammad Khalid Jamal, International Journal of Computer Applications (0975-8887), vol. 60, No. 13, Dec. 2012 (Year: 2012).
Haibin Liu, Vlado Keselj, “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering, vol. 61, Issue 2, 2007, pp. 304-330 (Year: 2007).
Sumathi et al., “Automatic Recommendation of Web Pages in Web Usage Mining,” International Journal on Computer Science and Engineering, vol. 02, No. 09, 2010 (Year: 2010).
Harrington, Caitlin “The Future of Shopping” Wired 26. 12:30. Conde Nast Publications Inc. (Dec. 2018).
Craver, Thom, Inside Bing's Spell Checker, Jan. 4, 2013, searchenginewatch.com, accessed at [https://www.searchenginewatch.com/2013/01/04/inside-beings-spell-checker/] (Year: 2013).
Business Wire [New York] “Data Warehousing Leader Acta Inc. Extends Award-Winning Technology to E-Commerce” Sep. 14, 1999 (Year: 1999).
Gong et al., IEEE Computer Society 3pgs. (Year: 2008) “A collaborative Recommender Combining Item Rating Similarity and Item Attribute Similarity”.
Continuations (1)
Number Date Country
Parent 13663353 Oct 2012 US
Child 17202012 US