EFFICIENT AD SELECTION IN AD EXCHANGE WITH INTERMEDIARIES
First Claim
1. A method for optimizing advertising (ad) selection in an ad exchange having intermediate ad-networks, the method executed by an exchange server having a processor and computer storage, the method comprising:
- a) constructing an exchange graph (G), in memory of the server, comprising nodes representing a plurality of publishers and advertisers, and one or more intermediate entities, the exchange graph also including a plurality of directed edges that represent bilateral business agreements connecting the nodes;
b) receiving, by the server, an opportunity for displaying an ad to a user, wherein the opportunity is associated with a publisher node and includes properties that are targetable by a plurality of supply predicates, wherein a supply predicate comprises a function whose inputs include properties of the user;
c) retrieving, by the server, a plurality of ads that are available for display to the user associated with respective advertiser nodes and that include properties that are targetable by a plurality of demand predicates, wherein a demand predicate comprises a function whose inputs include properties of one or more of the plurality of ads;
d) computing, by the server, a thinned graph (G′
) having fewer nodes by enforcing the supply predicates in the nodes and edges of the graph (G); and
e) producing, by the server, a list of ads and corresponding paths that exist through the thinned graph (G′
) to the opportunity that satisfy the plurality of demand predicates, and thus may be used to fill the display opportunity.
4 Assignments
0 Petitions
Accused Products
Abstract
A method is disclosed for optimizing ad selection in an exchange having intermediate ad-networks including: constructing an exchange graph having nodes representing publishers, advertisers, and intermediate ad-network entities, and including directed edges that represent bilateral business agreements connecting the nodes; receiving an opportunity for displaying an ad to a user that is associated with a publisher node and includes properties that are targetable by supply predicates, wherein a supply predicate is a function whose inputs include properties of the user; receiving ads that are available for display to the user associated with respective advertiser nodes and that include properties that are targetable by demand predicates, wherein a demand predicate is a function whose inputs include properties of one or more of the plurality of ads; computing a thinned graph by enforcing the supply predicates in the nodes and edges of the graph; and producing a list of ads and corresponding paths that exist through the thinned graph to the opportunity that satisfy the plurality of demand predicates.
24 Citations
22 Claims
-
1. A method for optimizing advertising (ad) selection in an ad exchange having intermediate ad-networks, the method executed by an exchange server having a processor and computer storage, the method comprising:
-
a) constructing an exchange graph (G), in memory of the server, comprising nodes representing a plurality of publishers and advertisers, and one or more intermediate entities, the exchange graph also including a plurality of directed edges that represent bilateral business agreements connecting the nodes; b) receiving, by the server, an opportunity for displaying an ad to a user, wherein the opportunity is associated with a publisher node and includes properties that are targetable by a plurality of supply predicates, wherein a supply predicate comprises a function whose inputs include properties of the user; c) retrieving, by the server, a plurality of ads that are available for display to the user associated with respective advertiser nodes and that include properties that are targetable by a plurality of demand predicates, wherein a demand predicate comprises a function whose inputs include properties of one or more of the plurality of ads; d) computing, by the server, a thinned graph (G′
) having fewer nodes by enforcing the supply predicates in the nodes and edges of the graph (G); ande) producing, by the server, a list of ads and corresponding paths that exist through the thinned graph (G′
) to the opportunity that satisfy the plurality of demand predicates, and thus may be used to fill the display opportunity. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system for optimizing advertising (ad) selection in an ad exchange having intermediate ad-networks, comprising:
a) an ad exchange server including a processor and computer storage, the exchange server coupled with a web server, wherein the processor is configured to; i) construct an exchange graph (G), in memory of the server, comprising nodes representing a plurality of publishers and advertisers, and one or more intermediate entities, the exchange graph also including a plurality of directed edges that represent bilateral business agreements connecting the nodes; ii) receive from the web server an opportunity for displaying an ad to a user, wherein the opportunity is associated with a publisher node and includes properties that are targetable by a plurality of supply predicates, wherein a supply predicate comprises a function whose inputs include properties of the user; iii) retrieve a plurality of ads that are available for display to the user associated with respective advertiser nodes and that include properties that are targetable by a plurality of demand predicates, wherein a demand predicate comprises a function whose inputs include properties of one or more of the plurality of ads; iv) compute a thinned graph (G′
) having fewer nodes by enforcing the supply predicates in the nodes and edges of the graph (G); andv) produce a list of ads and corresponding paths that exist through the thinned graph (G′
) to the opportunity that satisfy the plurality of demand predicates, and thus may be used to fill the display opportunity.- View Dependent Claims (10, 11, 12, 13, 14, 15)
-
16. A computer-readable storage medium comprising a set of instructions for optimizing ad selection in an ad exchange having intermediate ad-networks, the set of instructions to direct a processor to perform the acts of:
-
a) constructing an exchange graph (G), in memory of the server, comprising nodes representing a plurality of publishers and advertisers, and one or more intermediate entities, the exchange graph also including a plurality of directed edges that represent bilateral business agreements connecting the nodes; b) receiving, by the server, an opportunity for displaying an ad to a user, wherein the opportunity is associated with a publisher node and includes properties that are targetable by a plurality of supply predicates, wherein a supply predicate comprises a function whose inputs include properties of the user; c) retrieving, by the server, a plurality of ads that are available for display to the user associated with respective advertiser nodes and that include properties that are targetable by a plurality of demand predicates, wherein a demand predicate comprises a function whose inputs include properties of one or more of the plurality of ads; d) computing, by the server, a thinned graph (G′
) having fewer nodes by enforcing the supply predicates in the nodes and edges of the graph (G); ande) producing, by the server, a list of ads and corresponding paths that exist through the thinned graph (G′
) to the opportunity that satisfy the plurality of demand predicates, and thus may be used to fill the display opportunity. - View Dependent Claims (17, 18, 19, 20, 21, 22)
-
Specification