Disjoint Solution Sets for Advertisement Allocation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current advertisement delivery systems face challenges in optimizing advertisement allocation to forecasted impressions, as they often rely on single solution sets that do not maximize the number of impressions satisfied, leading to suboptimal advertisement placement.

Innovation Solution

The system generates disjoint solution sets for allocating advertisements to forecasted impressions, allowing for two advertisement options per impression, ensuring that each forecasted impression is associated with a unique advertisement from each set, and dynamically selects between these options based on previous allocations to maximize coverage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a single solution set is used for advertisement allocation, then the system complexity is low, but the number of impressions satisfied is suboptimal

Engineering Contradiction:
Improvenumber of impressions satisfiedVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent segments the advertisement allocation problem into multiple disjoint solution sets instead of using a single solution set. Each solution set represents a different valid allocation configuration, allowing the system to explore multiple allocation strategies simultaneously. This segmentation enables the system to satisfy more impressions by selecting from multiple possible allocations rather than being constrained to a single allocation approach.

Inventive Principle:
Principle #1Segmentation

2Productivity

If multiple disjoint solution sets are generated, then advertisement placement efficiency is maximized, but computational complexity increases

Engineering Contradiction:
Improveadvertisement placement efficiencyVSAvoidcomputational complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-generating multiple disjoint solution sets offline before the actual advertisement serving occurs. These solution sets are computed in advance and stored, allowing the system to quickly select from pre-prepared allocation options during runtime. This approach shifts the computational burden to an offline phase, reducing real-time complexity while maintaining high advertisement placement efficiency.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system dynamically selects between multiple pre-computed solution sets based on real-time conditions such as which advertisements have already been served. The selection process adapts to the current state by choosing the most appropriate solution set from the disjoint sets, enabling flexible and efficient advertisement allocation that responds to changing conditions without requiring complex real-time recomputation.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS8620752B2Advertisement allocation
Publication Date: 2013.12.31 GOOGLE LLC
  • US8620752B2 patent drawing
  • US8620752B2 patent drawing
  • US8620752B2 patent drawing

AI summary

Systems and methods for allocating and providing advertisements in response to impression events (e.g., a request for a placement of an advertisement) corresponding to forecasted impressions (e.g., a forecast of a request for a placement of an advertisement). The advertisements are allocated according to solution data that includes two disjoint solution sets, with each solution set identifying an advertisement that can be allocated to a forecasted impression.