WO2000038074A1 - Optimized internet advertising using history to select sites - Google Patents

Optimized internet advertising using history to select sites Download PDF

Info

Publication number
WO2000038074A1
WO2000038074A1 PCT/US1999/029419 US9929419W WO0038074A1 WO 2000038074 A1 WO2000038074 A1 WO 2000038074A1 US 9929419 W US9929419 W US 9929419W WO 0038074 A1 WO0038074 A1 WO 0038074A1
Authority
WO
WIPO (PCT)
Prior art keywords
view
advertisement
bid
sites
advertisements
Prior art date
Application number
PCT/US1999/029419
Other languages
French (fr)
Inventor
Heidi Kay
Russell Fradin
Original Assignee
Flycast Communications Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Flycast Communications Corp filed Critical Flycast Communications Corp
Priority to EP99967271A priority Critical patent/EP1159684A1/en
Priority to AU23580/00A priority patent/AU2358000A/en
Publication of WO2000038074A1 publication Critical patent/WO2000038074A1/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising

Definitions

  • the present invention relates to computer networks and more particularly to a system and method for presenting advertisements on the screens of computers that are connected to the Internet.
  • the Hyper Text Transfer Protocol (HTTP) and the Hyper Text Mark Up Language (HTML) provide a mechanism whereby one web site can easily link to a remote server.
  • HTTP mechanisms for referencing and obtaining material from a remote server is useful in providing advertising material for display to viewers.
  • Various web pages have links to this central server. With such an arrangement, when a viewer accesses a particular web page, a central server provides an advertisement that the viewer sees on the web page.
  • a database of viewer information can be compiled from a variety of sources including the information about a viewer that is available when a viewer accesses a server, in such prior art systems, the characteristics of the viewer as provided by the data base of viewer information determines the particular advertisement which is displayed when a particular viewer who accesses a web site. Other information such as the characteristics of the web site can also be used to determine which advertisement a viewer will see when a web site is accessed.
  • advertisers can target advertisements by criteria such as web site category, geographic location of the viewer, the operating system of the viewer's computer, the type of browser which the viewer is using, the internet domain type of the viewer, etc.
  • Advertisers who use such prior art systems must specify in advance, the targeting criteria they want to use for their advertisements.
  • the central server then provides advertisements to viewers based upon: (a) the targeting criteria established by the advertisers, (b) the information which the central server has in its data base concerning the particular viewer, (c) information about the web site that has been accessed by the viewer, and (d) other information available to the central server such as the time of day.
  • the previously referenced co-pending patent application describes a more complex system for providing advertisements from a central advertising server to viewers who access web sites. With the system shown in the referenced co-pending patent application the system evaluates, in real time, bids submitted by different advertisers in order to determine which particular advertisement will be displayed to a viewer.
  • the characteristics of each opportunity to present an advertisement to a viewer includes information such as the characteristics of the particular web page being accessed, the characteristics of the viewer including demographic information about the viewer, and information about other sites this viewer has accessed in the past.
  • each advertiser provides one or more "proposed bids" which specify how much the advertiser is willing to pay for displaying a particular advertisement in response to a view-op with certain characteristics.
  • Each proposed bid specifies a price or amount that the advertiser is willing to pay for the opportunity to display an advertisement (a) to a viewer who has a particular set of characteristics and (b) on a web site and web page that meets a particular set of criteria.
  • Each proposed bid can be dependent upon or require satisfaction of various criteria that must be met in order for a bid of a particular amount to be submitted.
  • a bidder might specify that the first one thousand times when a view-op meeting certain criteria occurs, a bid of five cents will be submitted, and each time thereafter that a view-op meeting the criteria occurs a bid of one cent will be submitted.
  • the amount bid for a view-op can be dependent on as many criteria as the advertiser cares to specify.
  • Another example is that an advertiser might bid ten cents if the view-op were from a viewer who had recently visited a particular web page and one cent for the same view-op if the viewer had not recently visited the particular web page.
  • Yet another example of a parameter that could be specified in a proposed bid is the rate at which viewers "click" on an advertisement to obtain more information about what is shown in the advertisement. The rate at which viewers "click” on an advertisement to access another site linked to the advertisement is often referred to as the "click-through rate".
  • the bidding parameters can be either simple or complex.
  • the system evaluates the characteristics of the view-op compared to the specifications of proposed bids.
  • the bid selection logic selects the highest bid from the various available bids and the advertisement that has the highest bid for the particular view-op is displayed.
  • the present invention is applicable to a system that includes: (a) a web server system which stores advertisements in data bases, (b) bidding agents which submit bids to display advertisements in view-ops which have certain specifications, and (c) bid selection logic which decides which bid to accept for each particular view-op.
  • a view-op occurs which meets the specifications in a bid
  • the view-op is further evaluated in terms of the comparative effectiveness of the particular advertisements on each of the sites on which the advertisement was previously displayed.
  • the frequency of the advertisement is increased on sites that have proved effective and decreased on sites that have a lower effectiveness.
  • the present invention thus adds an additional parameter that is considered and evaluated on a real time basis to determine if a particular advertisement should be displayed in response to a particular view-op. This additional parameter takes into consideration the effectiveness of this particular advertisement on the sites where it was previously displayed.
  • Figure 1 is a prior art system diagram.
  • Figures 2A and 2B are flow diagrams of the operations of the prior art system.
  • Figures 3A and 3B are flow diagrams of the present invention.
  • the present invention relates to an improvement in the bid selection logic 16C that is shown in Figure 1.
  • the system shown in Figures 1 operates as follows: A human viewer 10 utilizes a client web browser 1 1 to access a web page 12 on a web site 14. The web page 12 is transmitted to browser 1 1 in a conventional manner. Web page 12 includes an HTML reference to a file (i.e. an advertisement) located on an advertising web server system 16. The client web browser 11 has what is known in the art as a "cookie" 11A, which provides information from browser 1 1 to the web server system 16.
  • the client web browser 1 1 , the cookie 1 1 A, the web site 14 and the web page 12 are all conventional and in widespread use.
  • the client web browser 1 1 could be one of the commerciaily available web browsers, for example, the commercially available and widely used web browser marketed by Netscape Communications Corp. under the trademark "Netscape Navigator” or the browser marketed by Microsoft Corporation under the trademark "Internet Explorer”.
  • the web site 14 and the web page 12 could be any of the thousands of web sites and web pages which are part of the World Wide Web and which have HTML references to advertisements which are located on a remote server.
  • Web page 12 includes an HTML reference to an advertisement stored on advertising web server system 16. Each time client web browser 11 displays web page 12, the human viewer 10 will see an advertisement which is provided by advertising web server system 16. Such HTML references are in widespread use and they are implemented using conventional HTML tags.
  • Advertising web server system 16 includes a database of advertisements 16A, a database of viewer information 16B, and bid selection logic 16C.
  • the bid selection logic 16C receives bids from bidding agents 30A to 30Z which in turn receive information concerning proposed bids from bid input system 18. For purposes of illustration only three identical bidding agents 30A, 30B and 30Z are specifically shown.
  • the reference number 30 will be used to refer to a typical bidding agent. It should be understood that the system could include any number of bidding agents.
  • a system could include several thousand bidding agents 30.
  • Bid input system 18 provides bidding agents 30 with proposed bids which specify how much should be bid for view-ops with particular characteristics.
  • Each bidding agents 30 evaluates each view-op to determine if the view-op meets the criteria specified in a particular proposed bid and if so how much should be bid.
  • Each bidding agent 30 evaluates a view-op with respect to one proposed bid to determine if a bid should be submitted.
  • Each proposed bid includes a list of parameters that specify the particular type of viewer that the advertiser wants to reach. For example, a proposed bid might specify that the advertiser is willing to pay five cents for the opportunity to place an advertisement on a web page which is accessed by a viewer who has accessed three financial web pages and an automotive web page within the last week.
  • the system includes one bidding agent 30 for each proposed bid.
  • Each advertiser would have an associated bidding agent 30 for each ad campaign the advertiser wants to conduct.
  • Advertisers submit proposed bids to their associated bidding agents for evaluation against view-ops.
  • Bidding agents 30 can be simple or complex and if desired they can have the ability to evaluate more than one proposed bid to determine which bid should be submitted to the bid selection logic 16C.
  • the advertising web server system 16 When a view-op presents itself (i.e. when viewer 10 accesses a web page 1 1 which contains an HTML reference to server system 16) the advertising web server system 16 performs four operations: (1 ) It updates the information about the viewer that is in database 16B. (2) It sends information concerning the view-op to the bidding agents 30. The information sent includes information that the server system 16 received from browser 11 and information in database 16B. Bidding agents 30 in turn decide which bids to submit to bid selection logic 16C. (3) It compares various bids received from bidding agents 30 in order to determine which advertisement to display. (As explained later, with the present invention, additional information is considered in order to determine which advertisement should be displayed) and (4) It sends the appropriate advertisement from data base 16A to browser 11.
  • FIG. 2A shows how server system 16 uses the information from cookie 11 A to update the database of viewer information 16B to reflect the fact that this particular viewer has accessed this particular web page.
  • the operations proceed as shown by blocks 201 to 203.
  • Block 201 indicates that a viewer has selected web page 12 and that the selected web page has been transmitted to the viewer's browser 11.
  • web page 12 has an HTML reference to a file on server system 16 using conventional HTML techniques.
  • Block 203 indicates that the server 16 then obtains data from cookie 11 A to update the database of viewer information 16B.
  • the system determines which advertisement from database 16A to present to the viewer.
  • the manner in which the system performs these operations is shown by block diagram 2B.
  • one advertiser might have submitted a proposed bid to bidding agent 30A which specified that he is willing to pay five cents for displaying an ad to a viewer who has accessed at least three financial oriented web sites within the last week.
  • Another advertiser might have submitted a proposed bid to bidding agent 30B specifying that he is willing to pay six cents for displaying an advertisement to a viewer that has accessed at least three financial oriented web sites within the last five days.
  • bidding agents 30A and 30B When a view-op occurs which is initiated by a viewer 10 who has accessed three financial oriented web sites in the last five days, bidding agents 30A and 30B would determine that the particular view-op satisfies the criteria specified by both advertisers. Both bids would be submitted to bid selection logic 16C, and bid selection logic 16C would then select the highest bid, and the advertisement specified by that advertiser would be displayed to the viewer.
  • the criteria specified by the advertisers may be much more complex and involve many more parameters than those given in the simple example specified above. However, notwithstanding the complexity of the proposed bids and the number of parameters specified in each proposed bid, the basic operations performed by bidding agents 30 and by bid selection logic 16C are as illustrated in the above simple example.
  • a cycle of operation begins (block 210) when a viewer 10 selects a web page 12 which has a HTML reference to web server system 16, that is, when a view-op occurs. It is noted that this occurs in real time and it can take place thousands of times per second.
  • Block 211 indicates that the web server system 16 sends information concerning the view-op and related information in the database 16B to the bidding agents 30.
  • the bidding agents 30 compare the information about the view-op to the proposed bids that have been submitted by advertisers. That is, the bidding agents 30 determine if the characteristics of the view-op meet the criteria in the proposed bids and if so they submit bids to bid selection logic 16C (block 213).
  • the bid selection logic 16C compares various bids and selects the highest bid and therefore an advertisement for display. The appropriate advertisement called for by the winning bid is then sent from database 16A to browser 11 (block 215).
  • Block 212 indicates that each advertiser submits proposed bids.
  • Each bid includes various parameters that, for example, specify the type of web page on which the advertiser wants to advertise and an amount, (i.e. the dollar amount) which the advertiser is willing to pay for having a particular advertisement displayed
  • the bidding agents 30 evaluate proposed bids in microseconds, that is, in real time.
  • the rate at which "hits" on web pages occur i.e. the rate at which viewers access web pages that have HTML reference to server system 16
  • the evaluation of proposed bids is performed very quickly in real time.
  • Proposed bids can contain parameters which specify that a proposed bid will in effect change in real time. For example a proposed bid might specify that for the first 1000 matching view-ops, the proposed bid will be five cents and for the next 1000 matching view-ops the proposed bid will be four cents.
  • the actual submission of proposed bids by advertisers and the rate at which advertisers can change their proposed bids is measured in minutes compared to the rate at which the system evaluates proposed bids which is on the order of microseconds.
  • the present invention provides an additional parameter that is taken into account in determining which advertisement will be displayed in response to a particular view-op.
  • the additional parameter provided by the present invention is a parameter that is based upon the effectiveness of a particular advertisement on a particular web site in comparison to the effectiveness of this same advertisement on the other web sites where it has been displayed.
  • an advertiser wants to have an advertisement displayed 10,000 times per day for a 10 day period (that is, 100,000 time) in response to view ops that meet certain criteria. For this example assume: (a) that the advertiser bids ten cents for each of these view-ops. (b) that view-ops that meet the specifications in the bid are on average occurring on 1000 sites at a rate of 40 view-ops per day per site. (c) that the view-ops occur evenly spaced during the day and that the view ops occur in an even stream from the sites. That is the view-ops occur in an orderly sequence such as sitel , site2, site3 site 1000, site 1 , site2, site3, site 1000. (d) that for the view-ops on 500 of these sites, some other advertiser has a higher bid.
  • the advertisement would be displayed 20 times per day on each of the 500 sites. That is, the advertisement would be displayed 50 percent of the times that view-ops meeting the criteria occur. By displaying the ad 50% of the time that appropriate view-ops are presented the advertising campaign lasts the ten days in accordance with the original specifications provided by the advertiser. Note: 20 view-ops per day times 500 sites times 10 days equals 100,000 view-ops.
  • the first 1000 opportunities to display the advertisement are chosen using the old technique described above. This is termed an initialization period and it is used to obtain some data upon which subsequent decisions can be based.
  • the system makes the following calculation: Each site where the advertisement was presented during the initialization period is evaluated to determine the number of "click throughs” that resulted from the advertisements displayed on that site. Next the number of "click throughs” that would have resulted is calculated for each site based on the assumption that each opportunity to display on that site was taken. This gives a number which represents the "relative goodness" of each site.
  • the goodness numbers are as follows: For one hundred sites (called Sites A) the goodness is 10 For one hundred sites (called Sites B) the goodness is 8 For one hundred sites (called Sites C) the goodness is 5 For 200 sites the goodness is 1
  • the selection criteria for sites A is set to 100 percent.
  • the selection criteria for sites B is set to 80 percent
  • the selection criteria for sites C is set to 50 percent
  • the selection criteria for the remaining sites is set to 10 percent in order to continue gathering data from these sites for future calculations.
  • the percentages of all sites is chosen so that at the present rate of view-ops, the total view-ops specified in the bid will be reached in the desired time period.
  • the present invention optimizes the placement of advertisements, that is, advertisements are placed on sites where they are most effective. As described above, the optimization is based upon "click-through" rate. It is noted that the system could similarly optimize placement of advertisements based on a wide variety of other criteria. For example, instead of making the calculations based upon click-through rate, the calculations could be made based upon a measure of telephone inquires made as a result of advertisements, or upon the number of sales that result directly related to an advertisement. Any measurable criteria specified by an advertiser could be used in place of the click through rate described above. It is also noted that as described above, the initial selection of what advertisement to place on a site is based upon a bidding or auction system.
  • the present invention could also be applied in situations where the iseiection criteria is something other than a bidding system.
  • the initial selection is made as to which advertisement to place in response to a view-op, optimization could be achieved by calculating the relative goodness of placing advertisements on various sites as described herein and using this parameter in the selection process.
  • Figures 3A and 3B are flow diagrams showing the operation of the present invention.
  • Figure 3A shows the operation of the invention during the initialization period. This period continues until an advertisement is displayed 1000 times (or until an advertisement has been displayed for a pre-specified percent of the total number of impressions desired). For the present embodiment it is assumed that each advertisement is scheduled for display at least ten thousand times. Thus the initialization period can extend for up to ten percent of the times that an advertisement is displayed.
  • the initialization process takes much less than ten percent of the total view-ops.
  • the length of the initialization period is arbitrary, so long as it is long enough to give some valid data to use in the initial calculations.
  • FIG. 3B After the initialization period the process continues as shown in Figure 3B.
  • the series of steps shown in Figure 3B is performed as each view-op that meets a bid's specification becomes available.
  • the steps show in Figure 3A and 3B will now be explained in detail.
  • the steps shown in Figure 3A are performed during the initialization period.
  • blocks 301 , 303 and 305 when a view-op becomes available, its properties are compared to the properties set out in the various bids, and the highest matching bid is selected.
  • block 307 a determination is made as to whether or not this view-op is needed to meet the schedule set out in the winning bid. If it is not needed, this view op is assigned to the next lower matching bid as indicated by block 309.
  • Figure 3B shows the procedure that is followed after the initialization period. Steps 321 , 323, and 325 are identical to the corresponding steps shown in Figure 3A and previously explained.
  • the system looks at the results achieved at each site where an advertisement was previously displayed and the results achieved are examined. In the simplest case this would be the number of "click-throughs" which resulted from the advertisement. That is, the number of times a viewer clicked on the advertisement in order to be linked to the advertiser's web site. The actual number of click-throughs is adjusted to take into account the fact that not each appropriate view-op was selected in step 327.
  • Block 333 indicates that the selection or scheduling criteria for each site is set based upon the goodness numbers calculated in step 331.
  • the percentage of view-ops scheduled for each site is scaled so that these values are in proportion to the "goodness" numbers and so that the total number of placements desired by the advertiser will be met if the situation were to remain stable at the present values. It must however be recognized that while at each point these numbers are established on the basis that the situation will remain stable, the values are recalculated as each view-op occurs.
  • Block 335 indicates that a determination is then made based on the new scheduling and selection criteria. If it is determined that this view-op should be taken, the advertisement is displayed as indicated in block 339. After the advertisement is displayed, the system waits for the next appropriate view-op and the procedure is repeated. If the determination in block 335 results in a decision that the view-op should not be taken, the view-op is assigned to the next lower bid and the procedure is repeated for that bid.
  • FIG. 3A and 3B can be programmed in any appropriate computer language. The particular language taken would be determined by the particular computer system being used. Fast personal computers and servers are available. Such servers would normally be programmed using a language such as C++. The actual coding of the steps shown in Figures 3A and 3B is conventional.

Abstract

In a system that includes: (a) a web server system (16) which stores data bases of advertisements (16A) and viewer information (16B), (b) bidding agents (30A, 30B, and 30Z) which submit bids to display advertisements in view-ops which have certain specifications, and (c) bid selection logic (16C) which decides which bid to accept for each particular view-op. When a view-op occurs which meets the specifications in a bid, the view-op is further evaluated in terms of the comparative effectiveness of the particular advertisements on each of the sites on which the advertisement was previously displayed. The frequency of the advertisement is increased on sites that have proved effective and decreased on sites that have a lower effectiveness. The parameters are considered and evaluated on a real time basis to determine if a particular advertisement should be displayed in response to a particular view-op.

Description

OPTIMIZED INTERNET ADVERTISING USING HISTORY TO SELECT SITES
Field of the Invention: The present invention relates to computer networks and more particularly to a system and method for presenting advertisements on the screens of computers that are connected to the Internet.
Background of the Invention: As used herein the term viewer refers to an individual who views or looks at a web page using a program such as one of the commercially available web browsers. Co- pending patent application serial number 08/787,979 filed 1/22/97 entitled "Internet Advertising System" describes a system for presenting advertisements to viewers who access web sites on the Internet (i.e. the World Wide Web). The present invention is an improvement to the system shown in the above referenced patent application
The Hyper Text Transfer Protocol (HTTP) and the Hyper Text Mark Up Language (HTML) provide a mechanism whereby one web site can easily link to a remote server. The HTTP mechanisms for referencing and obtaining material from a remote server is useful in providing advertising material for display to viewers. There are commercially available systems that provide advertising material for web sites from a central server. Various web pages have links to this central server. With such an arrangement, when a viewer accesses a particular web page, a central server provides an advertisement that the viewer sees on the web page.
Using standard HTTP facilities it is possible to track when a particular viewer accesses a web site and thus it is possible to compile a data base which in essence provides a profile of the sites a particular viewer has accessed using the same browser. Furthermore, it is known that types of viewers generally access particular categories of web sites. The capabilities inherent in the World Wide Web for tracking the sites that a viewer has seen provides a mechanism for targeting particular advertisements to particular types of viewers.
There are prior art systems that provide advertisements from a central server that has a database of information on viewers. A database of viewer information can be compiled from a variety of sources including the information about a viewer that is available when a viewer accesses a server, in such prior art systems, the characteristics of the viewer as provided by the data base of viewer information determines the particular advertisement which is displayed when a particular viewer who accesses a web site. Other information such as the characteristics of the web site can also be used to determine which advertisement a viewer will see when a web site is accessed. Using such systems advertisers can target advertisements by criteria such as web site category, geographic location of the viewer, the operating system of the viewer's computer, the type of browser which the viewer is using, the internet domain type of the viewer, etc.
Advertisers who use such prior art systems must specify in advance, the targeting criteria they want to use for their advertisements. The central server then provides advertisements to viewers based upon: (a) the targeting criteria established by the advertisers, (b) the information which the central server has in its data base concerning the particular viewer, (c) information about the web site that has been accessed by the viewer, and (d) other information available to the central server such as the time of day. The previously referenced co-pending patent application describes a more complex system for providing advertisements from a central advertising server to viewers who access web sites. With the system shown in the referenced co-pending patent application the system evaluates, in real time, bids submitted by different advertisers in order to determine which particular advertisement will be displayed to a viewer.
The characteristics of each opportunity to present an advertisement to a viewer (that is, the characteristics of what is herein termed a view-op) includes information such as the characteristics of the particular web page being accessed, the characteristics of the viewer including demographic information about the viewer, and information about other sites this viewer has accessed in the past.
With the invention shown in the referenced co-pending application each advertiser provides one or more "proposed bids" which specify how much the advertiser is willing to pay for displaying a particular advertisement in response to a view-op with certain characteristics. Each proposed bid specifies a price or amount that the advertiser is willing to pay for the opportunity to display an advertisement (a) to a viewer who has a particular set of characteristics and (b) on a web site and web page that meets a particular set of criteria. Each proposed bid can be dependent upon or require satisfaction of various criteria that must be met in order for a bid of a particular amount to be submitted. For example a bidder might specify that the first one thousand times when a view-op meeting certain criteria occurs, a bid of five cents will be submitted, and each time thereafter that a view-op meeting the criteria occurs a bid of one cent will be submitted. The amount bid for a view-op can be dependent on as many criteria as the advertiser cares to specify. Another example is that an advertiser might bid ten cents if the view-op were from a viewer who had recently visited a particular web page and one cent for the same view-op if the viewer had not recently visited the particular web page. Yet another example of a parameter that could be specified in a proposed bid is the rate at which viewers "click" on an advertisement to obtain more information about what is shown in the advertisement. The rate at which viewers "click" on an advertisement to access another site linked to the advertisement is often referred to as the "click-through rate". The bidding parameters can be either simple or complex.
With the system shown in the co-pending application when a view-op arises, the system evaluates the characteristics of the view-op compared to the specifications of proposed bids. Next, the bid selection logic selects the highest bid from the various available bids and the advertisement that has the highest bid for the particular view-op is displayed.
Summary of the Present Invention: The present invention is applicable to a system that includes: (a) a web server system which stores advertisements in data bases, (b) bidding agents which submit bids to display advertisements in view-ops which have certain specifications, and (c) bid selection logic which decides which bid to accept for each particular view-op. With the present invention when a view-op occurs which meets the specifications in a bid, the view-op is further evaluated in terms of the comparative effectiveness of the particular advertisements on each of the sites on which the advertisement was previously displayed. The frequency of the advertisement is increased on sites that have proved effective and decreased on sites that have a lower effectiveness. The present invention thus adds an additional parameter that is considered and evaluated on a real time basis to determine if a particular advertisement should be displayed in response to a particular view-op. This additional parameter takes into consideration the effectiveness of this particular advertisement on the sites where it was previously displayed.
Brief Description of the Drawings: Figure 1 is a prior art system diagram. Figures 2A and 2B are flow diagrams of the operations of the prior art system. Figures 3A and 3B are flow diagrams of the present invention.
Description of a preferred embodiment: The present invention is an improvement on the type of prior art system shown and described in co-pending patent application serial number 08/787,979 filed 1/22/97 and entitled "Internet Advertising System" which is assigned to the same assignee as is the present application. The above referenced co-pending application is hereby incorporated herein by reference in its entirety. In order to explain the principles of the present invention, a simplified overall block diagram of the prior art system is shown in Figures 1 and a simplified block diagram of the operation of the prior art system is shown in Figures 2A and 2B.
After the operation of the overall prior system is described with reference to Figures 1 , 2A, and 2B the preferred embodiment of the present invention will be described with reference to Figures 3A and 3B. The present invention relates to an improvement in the bid selection logic 16C that is shown in Figure 1. The system shown in Figures 1 operates as follows: A human viewer 10 utilizes a client web browser 1 1 to access a web page 12 on a web site 14. The web page 12 is transmitted to browser 1 1 in a conventional manner. Web page 12 includes an HTML reference to a file (i.e. an advertisement) located on an advertising web server system 16. The client web browser 11 has what is known in the art as a "cookie" 11A, which provides information from browser 1 1 to the web server system 16. The client web browser 1 1 , the cookie 1 1 A, the web site 14 and the web page 12 are all conventional and in widespread use. For example, the client web browser 1 1 could be one of the commerciaily available web browsers, for example, the commercially available and widely used web browser marketed by Netscape Communications Corp. under the trademark "Netscape Navigator" or the browser marketed by Microsoft Corporation under the trademark "Internet Explorer". The web site 14 and the web page 12 could be any of the thousands of web sites and web pages which are part of the World Wide Web and which have HTML references to advertisements which are located on a remote server.
Web page 12 includes an HTML reference to an advertisement stored on advertising web server system 16. Each time client web browser 11 displays web page 12, the human viewer 10 will see an advertisement which is provided by advertising web server system 16. Such HTML references are in widespread use and they are implemented using conventional HTML tags. Advertising web server system 16 includes a database of advertisements 16A, a database of viewer information 16B, and bid selection logic 16C. The bid selection logic 16C receives bids from bidding agents 30A to 30Z which in turn receive information concerning proposed bids from bid input system 18. For purposes of illustration only three identical bidding agents 30A, 30B and 30Z are specifically shown. The reference number 30 will be used to refer to a typical bidding agent. It should be understood that the system could include any number of bidding agents. For example, a system could include several thousand bidding agents 30. Bid input system 18 provides bidding agents 30 with proposed bids which specify how much should be bid for view-ops with particular characteristics. Each bidding agents 30 evaluates each view-op to determine if the view-op meets the criteria specified in a particular proposed bid and if so how much should be bid.
Each bidding agent 30 evaluates a view-op with respect to one proposed bid to determine if a bid should be submitted. Each proposed bid includes a list of parameters that specify the particular type of viewer that the advertiser wants to reach. For example, a proposed bid might specify that the advertiser is willing to pay five cents for the opportunity to place an advertisement on a web page which is accessed by a viewer who has accessed three financial web pages and an automotive web page within the last week.
In general the system includes one bidding agent 30 for each proposed bid. Each advertiser would have an associated bidding agent 30 for each ad campaign the advertiser wants to conduct. Advertisers submit proposed bids to their associated bidding agents for evaluation against view-ops. Bidding agents 30 can be simple or complex and if desired they can have the ability to evaluate more than one proposed bid to determine which bid should be submitted to the bid selection logic 16C.
When a view-op presents itself (i.e. when viewer 10 accesses a web page 1 1 which contains an HTML reference to server system 16) the advertising web server system 16 performs four operations: (1 ) It updates the information about the viewer that is in database 16B. (2) It sends information concerning the view-op to the bidding agents 30. The information sent includes information that the server system 16 received from browser 11 and information in database 16B. Bidding agents 30 in turn decide which bids to submit to bid selection logic 16C. (3) It compares various bids received from bidding agents 30 in order to determine which advertisement to display. (As explained later, with the present invention, additional information is considered in order to determine which advertisement should be displayed) and (4) It sends the appropriate advertisement from data base 16A to browser 11.
The operations performed by advertising web server system 16 are shown in Figures 2A and 2B. Figure 2A shows how server system 16 uses the information from cookie 11 A to update the database of viewer information 16B to reflect the fact that this particular viewer has accessed this particular web page. The operations proceed as shown by blocks 201 to 203. Block 201 indicates that a viewer has selected web page 12 and that the selected web page has been transmitted to the viewer's browser 11. As indicated by block 202, web page 12 has an HTML reference to a file on server system 16 using conventional HTML techniques. Block 203 indicates that the server 16 then obtains data from cookie 11 A to update the database of viewer information 16B.
When a viewer 10 accesses web page 12, which has an HTML reference to server system 16, the system determines which advertisement from database 16A to present to the viewer. The manner in which the system performs these operations is shown by block diagram 2B. For example, one advertiser might have submitted a proposed bid to bidding agent 30A which specified that he is willing to pay five cents for displaying an ad to a viewer who has accessed at least three financial oriented web sites within the last week. Another advertiser might have submitted a proposed bid to bidding agent 30B specifying that he is willing to pay six cents for displaying an advertisement to a viewer that has accessed at least three financial oriented web sites within the last five days. When a view-op occurs which is initiated by a viewer 10 who has accessed three financial oriented web sites in the last five days, bidding agents 30A and 30B would determine that the particular view-op satisfies the criteria specified by both advertisers. Both bids would be submitted to bid selection logic 16C, and bid selection logic 16C would then select the highest bid, and the advertisement specified by that advertiser would be displayed to the viewer. The criteria specified by the advertisers may be much more complex and involve many more parameters than those given in the simple example specified above. However, notwithstanding the complexity of the proposed bids and the number of parameters specified in each proposed bid, the basic operations performed by bidding agents 30 and by bid selection logic 16C are as illustrated in the above simple example.
As shown in Figure 2B, a cycle of operation begins (block 210) when a viewer 10 selects a web page 12 which has a HTML reference to web server system 16, that is, when a view-op occurs. It is noted that this occurs in real time and it can take place thousands of times per second. Block 211 indicates that the web server system 16 sends information concerning the view-op and related information in the database 16B to the bidding agents 30. The bidding agents 30 compare the information about the view-op to the proposed bids that have been submitted by advertisers. That is, the bidding agents 30 determine if the characteristics of the view-op meet the criteria in the proposed bids and if so they submit bids to bid selection logic 16C (block 213). As shown by block 214, the bid selection logic 16C compares various bids and selects the highest bid and therefore an advertisement for display. The appropriate advertisement called for by the winning bid is then sent from database 16A to browser 11 (block 215).
Block 212 indicates that each advertiser submits proposed bids. Each bid includes various parameters that, for example, specify the type of web page on which the advertiser wants to advertise and an amount, (i.e. the dollar amount) which the advertiser is willing to pay for having a particular advertisement displayed
In order to understand the power of the type of system shown in Figures 1 and 2, it is important to realize that the bidding agents 30 evaluate proposed bids in microseconds, that is, in real time. The rate at which "hits" on web pages occur (i.e. the rate at which viewers access web pages that have HTML reference to server system 16) can be in the order of thousands per second. Thus, the evaluation of proposed bids is performed very quickly in real time. Proposed bids can contain parameters which specify that a proposed bid will in effect change in real time. For example a proposed bid might specify that for the first 1000 matching view-ops, the proposed bid will be five cents and for the next 1000 matching view-ops the proposed bid will be four cents. The actual submission of proposed bids by advertisers and the rate at which advertisers can change their proposed bids is measured in minutes compared to the rate at which the system evaluates proposed bids which is on the order of microseconds.
The operation of the browser 1 1 , the operation of the web server 14, and the manner in which web pages produce HTML references to web server system 16 using the HTTP protocol and HTML mark up language are described in numerous published books such as:"HTML Source Book A Complete Guide to HTML" by IAN S. Graham, published by John Wiley and Sons (ISBN 0 471 -11849-4) or "The Internet Compete Reference" by Harley Hahn and Rick Stout, published by Osborne McGraw-Hill, ISBN 0 07-881980-6. Numerous other books are also available which describe the HTTP protocol. Such books describe how a browser, such as 11 , can access a web page, such as web page 12, which in turn has an HTML reference to a file (i.e. an advertisement) stored on a server such as advertising server system 16.
The present invention provides an additional parameter that is taken into account in determining which advertisement will be displayed in response to a particular view-op. The additional parameter provided by the present invention is a parameter that is based upon the effectiveness of a particular advertisement on a particular web site in comparison to the effectiveness of this same advertisement on the other web sites where it has been displayed. The following highly structured and simplified example illustrates the operation of the present invention. The operation of the invention as applied to a "real-world" situation will be explained later.
Consider the following situation: an advertiser wants to have an advertisement displayed 10,000 times per day for a 10 day period (that is, 100,000 time) in response to view ops that meet certain criteria. For this example assume: (a) that the advertiser bids ten cents for each of these view-ops. (b) that view-ops that meet the specifications in the bid are on average occurring on 1000 sites at a rate of 40 view-ops per day per site. (c) that the view-ops occur evenly spaced during the day and that the view ops occur in an even stream from the sites. That is the view-ops occur in an orderly sequence such as sitel , site2, site3 site 1000, site 1 , site2, site3, site 1000. (d) that for the view-ops on 500 of these sites, some other advertiser has a higher bid.
Thus there will be 500 sites, each receiving 40 view-ops per day which fit the ad's criteria and where this advertiser's bid is the highest bid.
With the prior art system, the advertisement would be displayed 20 times per day on each of the 500 sites. That is, the advertisement would be displayed 50 percent of the times that view-ops meeting the criteria occur. By displaying the ad 50% of the time that appropriate view-ops are presented the advertising campaign lasts the ten days in accordance with the original specifications provided by the advertiser. Note: 20 view-ops per day times 500 sites times 10 days equals 100,000 view-ops.
With the present invention the above example would be handled as follows: The first 1000 opportunities to display the advertisement are chosen using the old technique described above. This is termed an initialization period and it is used to obtain some data upon which subsequent decisions can be based.
When the 1001st view-op is encountered the system makes the following calculation: Each site where the advertisement was presented during the initialization period is evaluated to determine the number of "click throughs" that resulted from the advertisements displayed on that site. Next the number of "click throughs" that would have resulted is calculated for each site based on the assumption that each opportunity to display on that site was taken. This gives a number which represents the "relative goodness" of each site.
Let us assume that the goodness numbers are as follows: For one hundred sites (called Sites A) the goodness is 10 For one hundred sites (called Sites B) the goodness is 8 For one hundred sites (called Sites C) the goodness is 5 For 200 sites the goodness is 1
The selection criteria for sites A is set to 100 percent. The selection criteria for sites B is set to 80 percent The selection criteria for sites C is set to 50 percent
The selection criteria for the remaining sites is set to 10 percent in order to continue gathering data from these sites for future calculations. The percentages of all sites is chosen so that at the present rate of view-ops, the total view-ops specified in the bid will be reached in the desired time period.
The above calculation is re-made each time a new viewing opportunity is presented. Thus in the example given above the calculation is made approximately ninety nine thousand times. It should be noted that sites not used for advertisements as a result of the calculations made as described above are made available to the next lower bidder and that in the placement of advertisements on these sites, the process described above is repeated.
It might seem that with the present invention a great deal of calculating is made in order to determine which advertisement should be placed in response to a view-op. However, it should be considered that in practice advertisers pay up to a few cents for presenting particular advertisements on particular sites. With modern day computers the cost of making the type of calculations required by the present invention are in the range of or less than mills (i.e. tenths of a cent) rather than cents
The present invention optimizes the placement of advertisements, that is, advertisements are placed on sites where they are most effective. As described above, the optimization is based upon "click-through" rate. It is noted that the system could similarly optimize placement of advertisements based on a wide variety of other criteria. For example, instead of making the calculations based upon click-through rate, the calculations could be made based upon a measure of telephone inquires made as a result of advertisements, or upon the number of sales that result directly related to an advertisement. Any measurable criteria specified by an advertiser could be used in place of the click through rate described above. It is also noted that as described above, the initial selection of what advertisement to place on a site is based upon a bidding or auction system. It is noted that the present invention could also be applied in situations where the iseiection criteria is something other than a bidding system. However, the initial selection is made as to which advertisement to place in response to a view-op, optimization could be achieved by calculating the relative goodness of placing advertisements on various sites as described herein and using this parameter in the selection process.
In some circumstances, a system might not include enough computational power to make a calculation each time a view-op occurs. In such a system, the calculations described herein could be made every other, every third, or on some other schedule. Naturally, limiting the frequency of the calculations would somewhat decrease the effectiveness of the system. Figures 3A and 3B are flow diagrams showing the operation of the present invention. Figure 3A shows the operation of the invention during the initialization period. This period continues until an advertisement is displayed 1000 times (or until an advertisement has been displayed for a pre-specified percent of the total number of impressions desired). For the present embodiment it is assumed that each advertisement is scheduled for display at least ten thousand times. Thus the initialization period can extend for up to ten percent of the times that an advertisement is displayed. It is however, noted that in practice, most Internet advertisements are displayed many more than 1000 times, thus, the initialization process takes much less than ten percent of the total view-ops. The length of the initialization period is arbitrary, so long as it is long enough to give some valid data to use in the initial calculations.
During the initialization period the results achieved by each advertisement in the form of "click throughs" is evaluated. As previously explained, while the present embodiment utilizes "click throughs" as a measure of the effectiveness of an advertisement in certain situations other measurements could be used. For example, in a situation where an advertisement results in a request for literature, the number of requests for literature could be a measure. Other measures of the effectiveness of advertisements could also be devised.
After the initialization period the process continues as shown in Figure 3B. The series of steps shown in Figure 3B is performed as each view-op that meets a bid's specification becomes available. The steps show in Figure 3A and 3B will now be explained in detail. The steps shown in Figure 3A are performed during the initialization period. As indicated by blocks 301 , 303 and 305, when a view-op becomes available, its properties are compared to the properties set out in the various bids, and the highest matching bid is selected. Next as indicated by block 307, a determination is made as to whether or not this view-op is needed to meet the schedule set out in the winning bid. If it is not needed, this view op is assigned to the next lower matching bid as indicated by block 309. If it is needed to meet the schedule, a check is made to determine if the initialization period is complete. If the initialization is not complete, the advertisement is displayed as indicated by block 312. As indicated by block 315, if the initialization period is complete, the process switches to the procedure shown in Figure 3B.
Figure 3B shows the procedure that is followed after the initialization period. Steps 321 , 323, and 325 are identical to the corresponding steps shown in Figure 3A and previously explained. Next as indicated by block 331 , the system looks at the results achieved at each site where an advertisement was previously displayed and the results achieved are examined. In the simplest case this would be the number of "click-throughs" which resulted from the advertisement. That is, the number of times a viewer clicked on the advertisement in order to be linked to the advertiser's web site. The actual number of click-throughs is adjusted to take into account the fact that not each appropriate view-op was selected in step 327. For example, if: (a) the advertisement was displayed one hundred times on a particular site and five click throughs resulted, (b) only fifty percent of the view-ops had been selected for display of this advertisement (that is, only fifty percent of the view-ops were selected in previous steps 307 and 335), then the relative goodness number would be "ten" for this site
Block 333 indicates that the selection or scheduling criteria for each site is set based upon the goodness numbers calculated in step 331. The percentage of view-ops scheduled for each site is scaled so that these values are in proportion to the "goodness" numbers and so that the total number of placements desired by the advertiser will be met if the situation were to remain stable at the present values. It must however be recognized that while at each point these numbers are established on the basis that the situation will remain stable, the values are recalculated as each view-op occurs.
Block 335 indicates that a determination is then made based on the new scheduling and selection criteria. If it is determined that this view-op should be taken, the advertisement is displayed as indicated in block 339. After the advertisement is displayed, the system waits for the next appropriate view-op and the procedure is repeated. If the determination in block 335 results in a decision that the view-op should not be taken, the view-op is assigned to the next lower bid and the procedure is repeated for that bid.
The flow diagrams shown in Figure 3A and 3B can be programmed in any appropriate computer language. The particular language taken would be determined by the particular computer system being used. Fast personal computers and servers are available. Such servers would normally be programmed using a language such as C++. The actual coding of the steps shown in Figures 3A and 3B is conventional.
It should be noted that it is herein assumed that a viewer always accesses the World Wide Web using the same browser, so that the cookie in a browser accurately reflects what a viewer has done. It is also assumed that only one viewer uses a particular browser, again so that the cookie in the browser accurately reflects what the particular viewer has done. Some inaccuracy in the calculations naturally results since the above assumptions are not always true. However, the resulting inaccuracy merely detracts from the overall efficiency of the advertising programs. Using the invention described herein nevertheless makes advertising more effective than it would be if the technique were not used.
While the invention has been shown and described with respect to a preferred embodiment thereof, the scope of the applicant's invention is limited only by the appended claims. Various changes in form and detail can be made without departing from the spirit and scope of the invention.

Claims

I claim:
1) A system for making advertisements available to web sites on the Internet which includes: a web server which stores advertisements, means for supplying selection criteria for view-ops which have particular characteristics, bid selection logic which makes calculation as each view-op is presented to determines if an advertisement should be supplied in response to a particular view-op, said calculations taking into account the results achieved by each display of the particular advertisement on the same site previously.
2) An Internet advertising system which includes bid selection logic that schedules advertisements on the sites that meet bid specifications based upon the results achieved by displaying the same advertisement on sites previously.
3) The system recited in claim 2 wherein said bid section logic makes a calculation of said schedule when each view-op appears after an initialization period.
4) The method of supplying advertisements to web sites on the World Wide Web which includes the steps of comparing the properties of each view-op to the characteristics set out in a selection criteria for advertising, and which schedules advertisements on web sites based upon the results achieved by previous advertisements places on each of the web sites where the advertisement was previously displayed.
5) An internet advertising system that includes: a web server system which stores advertisements and data bases, bidding agents which submit bids to display advertisements in view-ops which have certain specifications, and bid selection logic which decides which bid to accept for each particular view-op: said bid selection logic including evaluation logic operable when a view-op occurs which meets the specifications in a bid, for evaluating the comparative effectiveness of the particular advertisements on each of the sites on which the advertisement was previously displayed and wherein the frequency of the advertisement is increased on sites that have proved effective and decreased on sites that have a lower effectiveness.
6) The method recited in claim 4 wherein where after the properties of a view-op are compared to the characteristics set out in a plurality of bids for advertising, and the advertisement is displayed in response to the highest bid in accordance with a schedule.
7) The method recited in claim 6 wherein said results achieved are calculated based upon what would have happened if the advertisement here displayed on each appropriate view-op rather than in accordance with said schedule.
8) The method recited in claim 4 which includes an initialization period wherein said advertisement is not selected based upon the results previously achieved. 9) The method recited in claim 8 wherein after said initialization period, said results are calculated each time a view-op occurs.
10) The system recited in claim 5 wherein said evaluation logic is only operative after an evaluation period.
11) The system in claim 5 wherein said evaluation logic taken into consideration the action taken by a viewer in response to viewing an advertisement.
12) The system recited in claim 1 wherein the selection criteria is a monetary bid.
13) The system recited in claim 4 wherein said section criteria is a monetary bid.
PCT/US1999/029419 1998-12-18 1999-12-10 Optimized internet advertising using history to select sites WO2000038074A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP99967271A EP1159684A1 (en) 1998-12-18 1999-12-10 Optimized internet advertising using history to select sites
AU23580/00A AU2358000A (en) 1998-12-18 1999-12-10 Optimized internet advertising using history to select sites

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US21620698A 1998-12-18 1998-12-18
US09/216,206 1998-12-18

Publications (1)

Publication Number Publication Date
WO2000038074A1 true WO2000038074A1 (en) 2000-06-29

Family

ID=22806173

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1999/029419 WO2000038074A1 (en) 1998-12-18 1999-12-10 Optimized internet advertising using history to select sites

Country Status (3)

Country Link
EP (1) EP1159684A1 (en)
AU (1) AU2358000A (en)
WO (1) WO2000038074A1 (en)

Cited By (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1179951A2 (en) * 2000-08-10 2002-02-13 Deutsche Telekom AG Auction for the hierarchy of messages
WO2002031698A1 (en) * 2000-10-12 2002-04-18 E-Book Systems Pte. Ltd. Method and system for advertisement using internet browser with book-line interface
WO2004021110A2 (en) * 2002-08-27 2004-03-11 Google Inc. Method for providing advertising listing variance in distribution feeds
US20040249709A1 (en) 2002-11-01 2004-12-09 Donovan Kevin Rjb Method and system for dynamic textual ad distribution via email
EP1938217A2 (en) * 2005-08-10 2008-07-02 Google, Inc. Generating and presenting advertisements based on context data for programmable search engines
US7533090B2 (en) 2004-03-30 2009-05-12 Google Inc. System and method for rating electronic documents
US7579358B2 (en) 2003-09-26 2009-08-25 Boehringer Ingelheim International Gmbh Aerosol formulation for inhalation comprising an anticholinergic
US7603619B2 (en) 2005-11-29 2009-10-13 Google Inc. Formatting a user network site based on user preferences and format performance data
US7639898B1 (en) 2004-05-10 2009-12-29 Google Inc. Method and system for approving documents based on image similarity
US7657520B2 (en) 2005-03-03 2010-02-02 Google, Inc. Providing history and transaction volume information of a content source to users
US7725502B1 (en) 2005-06-15 2010-05-25 Google Inc. Time-multiplexing documents based on preferences or relatedness
US7752073B2 (en) 2002-07-16 2010-07-06 Google Inc. Method and system for providing advertising through content specific nodes over the internet
US7757080B1 (en) 2005-03-11 2010-07-13 Google Inc. User validation using cookies and isolated backup validation
US7801738B2 (en) 2004-05-10 2010-09-21 Google Inc. System and method for rating documents comprising an image
US7903099B2 (en) 2005-06-20 2011-03-08 Google Inc. Allocating advertising space in a network of displays
US7930206B2 (en) 2003-11-03 2011-04-19 Google Inc. System and method for enabling an advertisement to follow the user to additional web pages
US7971137B2 (en) 2005-12-14 2011-06-28 Google Inc. Detecting and rejecting annoying documents
US7996753B1 (en) 2004-05-10 2011-08-09 Google Inc. Method and system for automatically creating an image advertisement
US8023927B1 (en) 2006-06-29 2011-09-20 Google Inc. Abuse-resistant method of registering user accounts with an online service
US8050970B2 (en) 2002-07-25 2011-11-01 Google Inc. Method and system for providing filtered and/or masked advertisements over the internet
US8065611B1 (en) 2004-06-30 2011-11-22 Google Inc. Method and system for mining image searches to associate images with concepts
US8087068B1 (en) 2005-03-08 2011-12-27 Google Inc. Verifying access to a network account over multiple user communication portals based on security criteria
US8401902B1 (en) 2000-01-10 2013-03-19 Lucinda Stone Method for using computers to facilitate and control the creating of a plurality of functions
US8520982B2 (en) 2004-05-10 2013-08-27 Google Inc. Method and system for providing targeted documents based on concepts automatically identified therein
US8533141B2 (en) 2010-08-31 2013-09-10 Vibrant Media, Inc. Systems and methods for rule based inclusion of pixel retargeting in campaign management
US8719396B2 (en) 2005-05-20 2014-05-06 Vibrant Media Limited Fraud prevention and detection for online advertising
US8762280B1 (en) 2004-12-02 2014-06-24 Google Inc. Method and system for using a network analysis system to verify content on a website
US8918713B2 (en) 2005-12-12 2014-12-23 Google Inc. Module specification for a module to be incorporated into a container document
US8954861B1 (en) 2006-08-07 2015-02-10 Google Inc. Administrator configurable gadget directory for personalized start pages
US20150082345A1 (en) * 2011-09-29 2015-03-19 Avvasi Inc. System for generating enhanced advertizements and methods for use therewith
US9002895B2 (en) 2010-06-29 2015-04-07 Vibrant Media, Inc. Systems and methods for providing modular configurable creative units for delivery via intext advertising
US9031937B2 (en) 2005-08-10 2015-05-12 Google Inc. Programmable search engine
US9128909B2 (en) 2007-11-09 2015-09-08 Vibrant Media, Inc. Intelligent augmentation of media content
EP2922009A1 (en) 2014-03-18 2015-09-23 HURRA Communications GmbH Method for cross end device tracking of a user of an internet service, tracking server for carrying out such a method, and computer network with such a tracking server
US9262766B2 (en) 2011-08-31 2016-02-16 Vibrant Media, Inc. Systems and methods for contextualizing services for inline mobile banner advertising
US9294334B2 (en) 2005-12-12 2016-03-22 Google Inc. Controlling communication within a container document
US9348935B2 (en) 2010-06-29 2016-05-24 Vibrant Media, Inc. Systems and methods for augmenting a keyword of a web page with video content
US9754040B2 (en) 2006-08-07 2017-09-05 Google Inc. Configuring a content document for users and user groups
US9760541B2 (en) 2012-03-15 2017-09-12 Jason Richman Systems and methods for delivery techniques of contextualized services on mobile devices
US11409812B1 (en) 2004-05-10 2022-08-09 Google Llc Method and system for mining image searches to associate images with concepts
US11836759B2 (en) 2006-06-16 2023-12-05 Almondnet, Inc. Computer systems programmed to perform condition-based methods of directing electronic profile-based advertisements for display in ad space

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5515270A (en) * 1991-07-22 1996-05-07 Weinblatt; Lee S. Technique for correlating purchasing behavior of a consumer to advertisements
US5710884A (en) * 1995-03-29 1998-01-20 Intel Corporation System for automatically updating personal profile server with updates to additional user information gathered from monitoring user's electronic consuming habits generated on computer during use
US5724521A (en) * 1994-11-03 1998-03-03 Intel Corporation Method and apparatus for providing electronic advertisements to end users in a consumer best-fit pricing manner
US5774868A (en) * 1994-12-23 1998-06-30 International Business And Machines Corporation Automatic sales promotion selection system and method
US5974398A (en) * 1997-04-11 1999-10-26 At&T Corp. Method and apparatus enabling valuation of user access of advertising carried by interactive information and entertainment services
US5991735A (en) * 1996-04-26 1999-11-23 Be Free, Inc. Computer program apparatus for determining behavioral profile of a computer user
US6018619A (en) * 1996-05-24 2000-01-25 Microsoft Corporation Method, system and apparatus for client-side usage tracking of information server systems

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5515270A (en) * 1991-07-22 1996-05-07 Weinblatt; Lee S. Technique for correlating purchasing behavior of a consumer to advertisements
US5724521A (en) * 1994-11-03 1998-03-03 Intel Corporation Method and apparatus for providing electronic advertisements to end users in a consumer best-fit pricing manner
US5774868A (en) * 1994-12-23 1998-06-30 International Business And Machines Corporation Automatic sales promotion selection system and method
US5710884A (en) * 1995-03-29 1998-01-20 Intel Corporation System for automatically updating personal profile server with updates to additional user information gathered from monitoring user's electronic consuming habits generated on computer during use
US5991735A (en) * 1996-04-26 1999-11-23 Be Free, Inc. Computer program apparatus for determining behavioral profile of a computer user
US6018619A (en) * 1996-05-24 2000-01-25 Microsoft Corporation Method, system and apparatus for client-side usage tracking of information server systems
US5974398A (en) * 1997-04-11 1999-10-26 At&T Corp. Method and apparatus enabling valuation of user access of advertising carried by interactive information and entertainment services

Cited By (74)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8401902B1 (en) 2000-01-10 2013-03-19 Lucinda Stone Method for using computers to facilitate and control the creating of a plurality of functions
EP1179951A3 (en) * 2000-08-10 2005-12-28 Deutsche Telekom AG Auction for the hierarchy of messages
DE10039130A1 (en) * 2000-08-10 2002-02-21 Deutsche Telekom Ag Auctioning of ranks
EP1179951A2 (en) * 2000-08-10 2002-02-13 Deutsche Telekom AG Auction for the hierarchy of messages
US7376582B2 (en) 2000-10-12 2008-05-20 E-Book Systems Pte Ltd. Method and system for advertisement using internet browser with book-like interface
US6701301B2 (en) 2000-10-12 2004-03-02 E-Book Systems Pte Ltd Advertisement using internet browser with book-like interface
US6496803B1 (en) 2000-10-12 2002-12-17 E-Book Systems Pte Ltd Method and system for advertisement using internet browser with book-like interface
WO2002031698A1 (en) * 2000-10-12 2002-04-18 E-Book Systems Pte. Ltd. Method and system for advertisement using internet browser with book-line interface
US8429014B2 (en) 2002-07-16 2013-04-23 Google Inc. Method and system for providing advertising through content specific nodes over the internet
US20100332321A1 (en) * 2002-07-16 2010-12-30 Google Inc. Method and System for Providing Advertising Through Content Specific Nodes Over the Internet
US7752073B2 (en) 2002-07-16 2010-07-06 Google Inc. Method and system for providing advertising through content specific nodes over the internet
US8050970B2 (en) 2002-07-25 2011-11-01 Google Inc. Method and system for providing filtered and/or masked advertisements over the internet
WO2004021110A2 (en) * 2002-08-27 2004-03-11 Google Inc. Method for providing advertising listing variance in distribution feeds
WO2004021110A3 (en) * 2002-08-27 2005-01-06 Google Inc Method for providing advertising listing variance in distribution feeds
KR101230698B1 (en) * 2002-08-27 2013-02-07 구글 인코포레이티드 Method and system for providing advertising listing variance in distribution feeds over the internet to maximize revenue to the advertising distributor
US20040249709A1 (en) 2002-11-01 2004-12-09 Donovan Kevin Rjb Method and system for dynamic textual ad distribution via email
AU2003286841B2 (en) * 2002-11-01 2009-11-26 Google Llc Method and system for dynamic textual ad distribution via email
US20180165710A1 (en) * 2002-11-01 2018-06-14 Google Llc Method and system for dynamic content insertion in electronic messages
US8311890B2 (en) 2002-11-01 2012-11-13 Google Inc. Method and system for dynamic textual ad distribution via email
US10726445B2 (en) * 2002-11-01 2020-07-28 Google Llc Method and system for dynamic content insertion in electronic messages
AU2003286841B8 (en) * 2002-11-01 2011-10-06 Google Llc Method and system for dynamic textual ad distribution via email
US7579358B2 (en) 2003-09-26 2009-08-25 Boehringer Ingelheim International Gmbh Aerosol formulation for inhalation comprising an anticholinergic
US10115133B2 (en) 2003-11-03 2018-10-30 Google Llc Systems and methods for displaying morphing content items
US8838479B2 (en) 2003-11-03 2014-09-16 Google Inc. System and method for enabling an advertisement to follow the user to additional web pages
US7930206B2 (en) 2003-11-03 2011-04-19 Google Inc. System and method for enabling an advertisement to follow the user to additional web pages
US10650419B2 (en) 2003-11-03 2020-05-12 Google Llc System and method for enabling an advertisement to follow the user to additional web pages
US10621628B2 (en) 2003-11-03 2020-04-14 Google Llc System and method for enabling an advertisement to follow the user to additional web pages
US7533090B2 (en) 2004-03-30 2009-05-12 Google Inc. System and method for rating electronic documents
US10146776B1 (en) 2004-05-10 2018-12-04 Google Llc Method and system for mining image searches to associate images with concepts
US7639898B1 (en) 2004-05-10 2009-12-29 Google Inc. Method and system for approving documents based on image similarity
US7996753B1 (en) 2004-05-10 2011-08-09 Google Inc. Method and system for automatically creating an image advertisement
US9141964B1 (en) 2004-05-10 2015-09-22 Google Inc. Method and system for automatically creating an image advertisement
US11681761B1 (en) 2004-05-10 2023-06-20 Google Llc Method and system for mining image searches to associate images with concepts
US8254729B1 (en) 2004-05-10 2012-08-28 Google Inc. Method and system for approving documents based on image similarity
US8014634B1 (en) 2004-05-10 2011-09-06 Google Inc. Method and system for approving documents based on image similarity
US7801738B2 (en) 2004-05-10 2010-09-21 Google Inc. System and method for rating documents comprising an image
US9563646B1 (en) 2004-05-10 2017-02-07 Google Inc. Method and system for mining image searches to associate images with concepts
US8849070B2 (en) 2004-05-10 2014-09-30 Google Inc. Method and system for providing targeted documents based on concepts automatically identified therein
US11409812B1 (en) 2004-05-10 2022-08-09 Google Llc Method and system for mining image searches to associate images with concepts
US8520982B2 (en) 2004-05-10 2013-08-27 Google Inc. Method and system for providing targeted documents based on concepts automatically identified therein
US11775595B1 (en) 2004-05-10 2023-10-03 Google Llc Method and system for mining image searches to associate images with concepts
US8065611B1 (en) 2004-06-30 2011-11-22 Google Inc. Method and system for mining image searches to associate images with concepts
US10257208B1 (en) 2004-12-02 2019-04-09 Google Llc Method and system for using a network analysis system to verify content on a website
US8762280B1 (en) 2004-12-02 2014-06-24 Google Inc. Method and system for using a network analysis system to verify content on a website
US7657520B2 (en) 2005-03-03 2010-02-02 Google, Inc. Providing history and transaction volume information of a content source to users
US8413219B2 (en) 2005-03-08 2013-04-02 Google Inc. Verifying access rights to a network account having multiple passwords
US8087068B1 (en) 2005-03-08 2011-12-27 Google Inc. Verifying access to a network account over multiple user communication portals based on security criteria
US7757080B1 (en) 2005-03-11 2010-07-13 Google Inc. User validation using cookies and isolated backup validation
US8719396B2 (en) 2005-05-20 2014-05-06 Vibrant Media Limited Fraud prevention and detection for online advertising
US8862568B2 (en) 2005-06-15 2014-10-14 Google Inc. Time-multiplexing documents based on preferences or relatedness
US7725502B1 (en) 2005-06-15 2010-05-25 Google Inc. Time-multiplexing documents based on preferences or relatedness
US7903099B2 (en) 2005-06-20 2011-03-08 Google Inc. Allocating advertising space in a network of displays
EP1938217A4 (en) * 2005-08-10 2011-06-22 Google Inc Generating and presenting advertisements based on context data for programmable search engines
EP1938217A2 (en) * 2005-08-10 2008-07-02 Google, Inc. Generating and presenting advertisements based on context data for programmable search engines
US9031937B2 (en) 2005-08-10 2015-05-12 Google Inc. Programmable search engine
US9703886B2 (en) 2005-11-29 2017-07-11 Google Inc. Formatting a user network site based on user preferences and format performance data
US7603619B2 (en) 2005-11-29 2009-10-13 Google Inc. Formatting a user network site based on user preferences and format performance data
US9294334B2 (en) 2005-12-12 2016-03-22 Google Inc. Controlling communication within a container document
US8918713B2 (en) 2005-12-12 2014-12-23 Google Inc. Module specification for a module to be incorporated into a container document
US9916293B2 (en) 2005-12-12 2018-03-13 Google Llc Module specification for a module to be incorporated into a container document
US7971137B2 (en) 2005-12-14 2011-06-28 Google Inc. Detecting and rejecting annoying documents
US11836759B2 (en) 2006-06-16 2023-12-05 Almondnet, Inc. Computer systems programmed to perform condition-based methods of directing electronic profile-based advertisements for display in ad space
US8023927B1 (en) 2006-06-29 2011-09-20 Google Inc. Abuse-resistant method of registering user accounts with an online service
US8768302B2 (en) 2006-06-29 2014-07-01 Google Inc. Abuse-resistant method of providing invitation codes for registering user accounts with an online service
US9754040B2 (en) 2006-08-07 2017-09-05 Google Inc. Configuring a content document for users and user groups
US8954861B1 (en) 2006-08-07 2015-02-10 Google Inc. Administrator configurable gadget directory for personalized start pages
US9128909B2 (en) 2007-11-09 2015-09-08 Vibrant Media, Inc. Intelligent augmentation of media content
US9348935B2 (en) 2010-06-29 2016-05-24 Vibrant Media, Inc. Systems and methods for augmenting a keyword of a web page with video content
US9002895B2 (en) 2010-06-29 2015-04-07 Vibrant Media, Inc. Systems and methods for providing modular configurable creative units for delivery via intext advertising
US8533141B2 (en) 2010-08-31 2013-09-10 Vibrant Media, Inc. Systems and methods for rule based inclusion of pixel retargeting in campaign management
US9262766B2 (en) 2011-08-31 2016-02-16 Vibrant Media, Inc. Systems and methods for contextualizing services for inline mobile banner advertising
US20150082345A1 (en) * 2011-09-29 2015-03-19 Avvasi Inc. System for generating enhanced advertizements and methods for use therewith
US9760541B2 (en) 2012-03-15 2017-09-12 Jason Richman Systems and methods for delivery techniques of contextualized services on mobile devices
EP2922009A1 (en) 2014-03-18 2015-09-23 HURRA Communications GmbH Method for cross end device tracking of a user of an internet service, tracking server for carrying out such a method, and computer network with such a tracking server

Also Published As

Publication number Publication date
AU2358000A (en) 2000-07-12
EP1159684A1 (en) 2001-12-05

Similar Documents

Publication Publication Date Title
WO2000038074A1 (en) Optimized internet advertising using history to select sites
US20070299682A1 (en) System and method for real-time bidding for Internet advertising space
US8364541B2 (en) System and method for real-time bidding for internet advertising space
AU735991B2 (en) Internet advertising system
US20060026062A1 (en) System and method for optimizing advertising marketplace operations
US20060026064A1 (en) Platform for advertising data integration and aggregation
JP4030841B2 (en) System and method for ranking and value protection in a search result list generated by a computer network search engine
US7546249B2 (en) System and method for managing advertising inventory to maximize advertising revenue
US8700462B2 (en) System and method for optimizing advertisement campaigns using a limited budget
US20060122879A1 (en) Method and system for pricing electronic advertisements
US20140278913A1 (en) Advertisement campaign simulator
US20120130829A1 (en) Bidding for placement of advertisements in real time
US20070022005A1 (en) Method for requesting, displaying, and facilitating placement of an advertisement in a computer network
US20080065479A1 (en) System and method for optimizing online advertisement auctions by applying linear programming using special ordered sets
KR20060052978A (en) System and method for managing an advertising campaign on a network
KR20050106444A (en) Method and apparatus for determining a minimum price per click for a term in an auction based internet search
US20060129453A1 (en) System and method for display advertising
US10275793B2 (en) Content delivery system using natural query events
US10026113B2 (en) Online marketplace to facilitate the distribution of marketing services from a marketer to an online merchant
US20120226548A1 (en) Method for requesting, displaying, and facilitating placement of an advertisement in a computer network
Feng et al. Implementing paid placement in web search engines: Computational evaluation of alternative mechanisms
Trimponias et al. A Survey on Sponsored Search Advertising in Large Commercial Search Engines

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 1999967271

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWW Wipo information: withdrawn in national office

Ref document number: 1999967271

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1999967271

Country of ref document: EP