PRICING ACROSS KEYWORDS ASSOCIATED WITH ONE OR MORE ADVERTISEMENTS

• US 20100114695A1
• Filed: 01/11/2010
• Published: 05/06/2010
• Est. Priority Date: 01/10/2003
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Veach, Eric
• Granted Patent: US 7,930,210 B2
• Time in Patent Office: Days
• US Class Current: 705/14.480
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0241 Advertisements
• CPC Class Codes: G06Q 30/0249 based upon budgets or funds
• CPC Class Codes: G06Q 30/0256 User search
• CPC Class Codes: G06Q 30/0269 based on user profile or attribute
• CPC Class Codes: G06Q 30/0273 Determination of fees for advertising
• CPC Class Codes: G06Q 30/0275 Auctions
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

Helping advertisers by simplifying the management of interactive advertising. Such simplification can by achieved by allowing an advertiser to specify a single bid for multiple keywords associated with an advertisement. When used in conjunction with a maximum cost bid, advertisers are not penalized with higher costs for such simplification.

Claims

1. Apparatus for associating advertisements, keywords, and bid information, the apparatus comprising:

a) at least one processor;

b) an input for

i) accepting one or more advertisements or information identifying the one or more advertisements, and

ii) accepting at least two keywords and a single maximum bid amount; and

c) at least one storage device storing program instructions which, when executed by the at least one processor, (A) stores an association between the single maximum bid amount and each of the at least two keywords, (B) stores an association between (1) each of the at least two keywords and the single maximum bid amount and (2) the one or more advertisements or information identifying the one or more advertisements, (C) receives an ad request, (D) determines whether the one or more advertisements are relevant to the received ad request using each of the at least two keywords independently, (E) determines a first cost associated with serving the one or more advertisements responsive to a first query having a term matching a first of the at least two keywords associated with the single maximum bid amount, and (F) determines a second cost, which is different than the first cost, associated with serving the one or more advertisements responsive to a second query having a term matching another of the at least two keywords associated with the single maximum bid amount,

wherein at least one of the first cost and the second cost is less than the single maximum bid amount associated with the at least two keywords.

2. The apparatus of claim 1 wherein the advertisement is a text-based advertisement.

3. The apparatus of claim 1 wherein the single maximum bid amount is a maximum bid per impression and wherein the first and second costs are based on impressions of the one or more advertisements served.

4. The apparatus of claim 1 wherein the single maximum bid amount is a maximum bid per selection and wherein the first and second costs are based on selections of the one or more advertisements served.

5. The apparatus of claim 1 wherein the single maximum bid amount is a maximum bid per conversion and wherein the first and second costs are based on conversions of the one or more advertisements served.

6. The apparatus of claim 1 wherein at least one of the at least two keywords is a broad match keyword.

7. The apparatus of claim 1 wherein at least one of the at least two keywords is an exact match keyword.

8. The apparatus of claim 1 wherein at least one of the at least two keywords is a phrase match keyword.

9. The apparatus of claim 1 wherein at least one of the at least two keywords is a negative match keyword.

10. The apparatus of claim 1 wherein the advertisement is a graphical banner ad.

11. The apparatus of claim 1 wherein a first of the at least two keywords is one of (A) a broad match keyword, (B) an exact match keyword, (C) a phrase match keyword, and (D) a negative match keyword, and wherein a second of the at least two keywords is a different one of (A) a broad match keyword, (B) an exact match keyword, (C) a phrase match keyword, and (D) a negative match keyword, than the first of the at least two keywords.

12. A machine readable medium having stored thereon:

a) information uniquely identifying at least two advertisements;

b) at least two keywords associated with the information uniquely identifying the at least two advertisements; and

c) a single maximum bid amount, input via an ad information entry interface, stored in association with each of with the at least two keywords and the at least two advertisements,

wherein the single maximum bid is stored in association with each of the at least two keywords and the at least two advertisements responsive to the input specifying the single maximum bid amount;

d) a first cost associated with serving the at least two advertisements responsive to a first query having a term matching a first of the at least two keywords associated with the single maximum bid amount; and

e) a second cost, which is different than the first cost, associated with serving the at least two advertisements responsive to a second query having a term matching another of the at least two keywords associated with the single maximum bid amount,

wherein at least one of the first cost and the second cost is less than the single maximum bid amount associated with the at least two keywords.

13. The machine readable medium of claim 12 wherein the single maximum bid amount is selected from a group of bid information consisting of (A) a maximum bid per impression, (B) a maximum bid per selection, and (C) a maximum bid per conversion.

14. Apparatus for associating advertisement, keywords, and bid information, the apparatus comprising:

a) at least one processor;

b) an input for

i) accepting at least two advertisements or information identifying the at least two, and

ii) accepting at least two keywords and a single maximum bid amount; and

c) at least one storage device storing program instructions which, when executed by the at least one processor, (A) stores an association between the single maximum bid amount and each of the at least two keywords, (B) stores an association between (1) each of the at least two keywords and the single maximum bid amount and (2) the at least two advertisements or information identifying the at least two advertisements, (C) receives an ad request, (D) determines whether the at least two advertisements are relevant to the received ad request using each of the least two keywords independently, (E) determines a first cost associated with serving the at least two advertisements responsive to a first query having a term matching a first of the at least two keywords associated with the single maximum bid amount, and (F) determines a second cost, which is different than the first cost, associated with serving the at least two advertisements responsive to a second query having a term matching another of the at least two keywords associated with the single maximum bid amount,

wherein at least one of the first cost and the second cost is less than the single maximum bid amount associated with the at least two keywords.