Abstract: Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.

Abstract: Systems, methods, and computer-readable storage media that may be used to generate competitor-specific bidding recommendations are provided. One method includes identifying, at a computerized analysis system, at least one competitor of a content provider within a plurality of content auctions for displaying content items. The method further includes calculating, at the analysis system, at least one bidding action estimated to improve performance of the content provider in future content auctions with respect to the at least one competitor from a current level to a goal level of the performance metric. The method further includes providing a recommendation to the content provider to implement the at least one bidding action.

Abstract: Systems, methods, and computer-readable storage media that may be used to provide bid adjustment recommendations for budget-constrained content campaigns are provided. One method includes identifying a content campaign eligible for each of a plurality of auctions that was excluded from at least some of the auctions based on a budget constraint. The method further includes simulating the auctions using one or more adjusted bid values and generating estimated results for the adjusted bid values based on the simulated auctions. The method further includes determining at least one adjusted bid value that is estimated to result in at least one of the following: (1) increased clicks under substantially the same budget constraint; (2) increased clicks at substantially the same total cost; or (3) decreased cost with substantially the same number of clicks. The method further includes providing at least one recommendation to adopt the at least one adjusted bid value.

Abstract: Systems and methods for identifying competitors using content extensions in content items in content items associated with their content placement campaigns are described. A processor identifies one or more competing entities from auctions in which the first entity places a bid. The competing entities are associated with content items having a first type of content extension that received impressions in at least one identified auction. The processor computes an overlap rate based on a number of auctions in which both a content item having the first type of content extension of the identified competing entity and a content item of the first entity received impressions and a number of auctions in which a content item having the first type of content extension of the identified competing entity received an impression and the first entity competed. The processor ranks the competing entities based on the computed overlap rate.

Abstract: Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.

Abstract: Systems and methods for suggesting a bid adjustment value based on device type include receiving parameters for a third-party content provider's campaign to present third-party content on a first type of device. Based on the campaign's parameters, bids from peer providers that use similar campaign parameters for both the first type of device and another type of device may be identified. For example, bids from providers that use similar parameters as the campaign for both mobile and desktop devices may be identified. The identified bids from the peer providers may be used to calculate a bid adjustment value. The bid adjustment value can be provided for presentation to the third-party content provider as a suggested change to his or her bid for the first type of device, to establish a bid for the second type of device.