IP Library Granted Patent US 11,210,707
Granted Patent B2
US 11,210,707 · App. 16/855,765 · Granted Dec 28, 2021

Network proxy bidding system

Inventors: Joerg Heilig (Los Altos, CA); Scott Spencer (New York, NY); Rahul Bafna (New York, NY); Wayne W. Lin (San Francisco, CA)
Assignee: Google LLC
G06Q30/0275G06Q30/02G06Q30/08
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,210,707
App. No.
16/855,765
Granted
Dec 28, 2021
Kind
B2
Abstract

Methods, systems and computer program products for submitting a network proxy bid and replacing the network proxy bid with an actual bid associated with advertisement placement are described. In some implementations, instead of submitting a static bid, an advertiser can submit a network proxy bid to an advertising exchange. A network proxy bid can indicate to the advertising exchange that the advertiser wishes to receive a call back from the advertising exchange when an impression matching targeting criteria specified by the advertiser becomes available. The advertiser then can calculate and submit an actual static bid to replace the network proxy bid in response to the call back.

Claims (43)

1. A computer-implemented method comprising:

storing, in a cache of a content exchange including one or more computing devices, historical data including past actual static bids submitted by a plurality of content networks;

identifying, by the content exchange, the plurality of content networks for an impression associated with a particular category;

determining, by the content exchange, not to make a call back to a particular content network among the plurality of content networks when the past actual static bids submitted by the particular content network were winning bids for less than a specified portion of impressions in the particular category;

excluding, by the content exchange, the respective content network from a subset of the plurality of content networks that are eligible to receive a call back based on the determination not to make a call back to the respective content network; and

sending, by the content exchange, call backs to the subset of the plurality of content networks.

2. The computer-implemented method of claim 1 , wherein the historical bid data includes values of the past actual static bids, targeting criteria associated with the past actual static bids, and whether or not the past actual static bids submitted were chosen as winning bids.

3. The computer-implemented method of claim 1 , further comprising:

at a later time, determining that the particular content network has submitted winning actual static bids; and

increasing a frequency of call backs to the particular content network for impressions associated with the particular category.

4. The computer-implemented method of claim 1 , further comprising, sending, by the content exchange, a call back to one or more content networks that historically submit non-competitive bids at scheduled intervals for impressions in the particular category.

5. The computer-implemented method of claim 1 , further comprising determining, for each content network among the plurality of content networks, a maximum bid based on program code associated with a proxy bid for the content network.

6. The computer-implemented method of claim 5 , wherein determining not to make a call back to the particular content network is further based on the determined maximum bid for the particular content network.

7. The computer-implemented method of claim 5 , wherein determining the maximum bid comprises determining the maximum bid based on executing the program code on one or more criteria characterizing the impression.

8. A system, comprising:

one or more processors; and

a computer-readable medium operatively coupled to the one or more processors and including instructions that cause the one or more processors to perform operations comprising:

storing historical data including past actual static bids submitted by a plurality of content networks;

identifying the plurality of content networks for an impression associated with a particular category;

determining not to make a call back to a particular content network among the plurality of content networks when the past actual static bids submitted by the particular content network were winning bids for less than a specified portion of impressions in the particular category;

excluding the respective content network from a subset of the plurality of content networks that are eligible to receive a call back based on the determination not to make a call back to the respective content network; and

sending call backs to the subset of the plurality of content networks.

9. The system of claim 8 , wherein the historical bid data includes values of the past actual static bids, targeting criteria associated with the past actual static bids, and whether or not the past actual static bids submitted were chosen as winning bids.

10. The system of claim 8 , wherein the instructions cause the one or more processors to perform operations comprising:

at a later time, determining that the particular content network has submitted winning actual static bids; and

increasing a frequency of call backs to the particular content network for impressions associated with the particular category.

11. The system of claim 8 , wherein the instructions cause the one or more processors to perform operations comprising, sending, by the content exchange, a call back to one or more content networks that historically submit non-competitive bids at scheduled intervals for impressions in the particular category.

12. The system of claim 8 , wherein the instructions cause the one or more processors to perform operations comprising determining, for each content network among the plurality of content networks, a maximum bid based on program code associated with a proxy bid for the content network.

13. The system of claim 12 , wherein determining not to make a call back to the particular content network is further based on the determined maximum bid for the particular content network.

14. The system of claim 12 , wherein determining the maximum bid comprises determining the maximum bid based on executing the program code on one or more criteria characterizing the impression.

15. A non-transitory computer readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

storing historical data including past actual static bids submitted by a plurality of content networks;

identifying the plurality of content networks for an impression associated with a particular category;

determining not to make a call back to a particular content network among the plurality of content networks when the past actual static bids submitted by the particular content network were winning bids for less than a specified portion of impressions in the particular category;

excluding the respective content network from a subset of the plurality of content networks that are eligible to receive a call back based on the determination not to make a call back to the respective content network; and

sending call backs to the subset of the plurality of content networks.

16. The non-transitory computer readable medium of claim 15 , wherein the historical bid data includes values of the past actual static bids, targeting criteria associated with the past actual static bids, and whether or not the past actual static bids submitted were chosen as winning bids.

17. The non-transitory computer readable medium of claim 15 , wherein the instructions cause the one or more processors to perform operations comprising:

at a later time, determining that the particular content network has submitted winning actual static bids; and

increasing a frequency of call backs to the particular content network for impressions associated with the particular category.

18. The non-transitory computer readable medium of claim 15 , wherein the instructions cause the one or more processors to perform operations comprising, sending, by the content exchange, a call back to one or more content networks that historically submit non-competitive bids at scheduled intervals for impressions in the particular category.

19. The non-transitory computer readable medium of claim 15 , wherein the instructions cause the one or more processors to perform operations comprising determining, for each content network among the plurality of content networks, a maximum bid based on program code associated with a proxy bid for the content network.

20. The non-transitory computer readable medium of claim 19 , wherein determining not to make a call back to the particular content network is further based on the determined maximum bid for the particular content network.

Assignments (2)
CHANGE OF NAME Recorded Jun 12, 2020
From: GOOGLE INC.
To: GOOGLE LLC
Reel/Frame 052933/0182 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 11, 2020
From: HEILIG, JOERG; SPENCER, SCOTT; BAFNA, RAHUL; LIN, WAYNE W.
To: GOOGLE INC.
Reel/Frame 052912/0894 →
Continuity (4)
Continuation 15464992 · Mar 21, 2017
Continuation 12607690 · Oct 28, 2009
Provisional Application 61110387 · Oct 31, 2008
Related Publication 20200250710A1 · Aug 6, 2020