# US 2014/0195334 A1 · Systems and methods for optimizing data driven media placement

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2014/0195334 A1
- Document ID: US20140195334A1
- Status: Published application
- Kind: A1
- Application number: 14/142,226
- Filed: 2013-12-27
- Published: 2014-07-10
- Earliest claimed: 2013-01-10
- Assignees: United Video Properties, Inc.
- Applicants: United Video Properties, Inc.
- Inventors: Matthew Emans; John Hoctor; Jonathan Turner
- Web page: https://patentgrep.com/patent/US20140195334A1

## CPC

- G06Q 30/0244: {Optimization}
- G06Q 30/0241: Advertisements
- G06Q 30/0249: {based upon budgets or funds}
- G06Q 30/0264: {based upon schedule}
- G06Q 30/0273: Determination of fees for advertising
- H04N 21/2542: {for selling goods, e.g. TV shopping (payment schemes, payment architectures or payment protocols for electronic shopping systems G06Q20/12)}
- H04N 21/2543: Billing {, e.g. for subscription services (payment schemes, architectures or protocols G06Q20/00; e-commerce G06Q30/00; arrangements for billing for the use of broadcast information or broadcast-related information H04H60/21)}
- H04N 21/2547: Third Party Billing, e.g. billing of advertiser
- H04N 21/26241: {involving the time of distribution, e.g. the best time of the day for inserting an advertisement or airing a children programme}
- H04N 21/2668: Creating a channel for a dedicated end-user group, e.g. insertion of targeted commercials based on end-user profiles {(information retrieval from the Internet by querying with filtering and personalisation G06F16/9535; arrangements for replacing or switching information during the broadcast H04H20/10; push services over packet-switching network H04L12/1859; adaptation of message content in packet-switching networks H04L51/063)}
- H04N 21/812: {involving advertisement data (advertising per se G06Q30/02)}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

System and methods are presented for selecting advertising slots in an advertising campaign with an audience management system. In some embodiments, a user selects a budget value, which is partitioned into a first and second partition value. The audience management module stores a plurality of data structures in a memory, and defines a plurality of groups such that each of the plurality of data structures is associated with one of the plurality of groups. A portion of the first partition value is allocated to each of the plurality of groups, and the audience management module flags, for each group, at least one data structure based on the portion of the first partition value allocated to the group. The audience management module identifies a subset of unflagged data structures, and flags at least one data structure based on the second partition value.

## Claims

### Claim 1

A method for selecting advertising slots in an advertising campaign, the method comprising:
receiving a user selection of a budget value;
storing the budget value in a memory;
partitioning the budget value into a first partition value and a second partition value, wherein each of the first and second partition values is stored in the memory;
storing a plurality of data structures in the memory;
defining a plurality of groups, wherein each of the plurality of data structures is associated with one of the plurality of groups;
allocating a portion of the first partition value to each of the plurality of groups;
flagging, for each of the plurality of groups, at least one data structure associated with the group based on the portion of the first partition value allocated to the group;
identifying a subset of unflagged data structures within the plurality of data structures; and
flagging at least one data structure within the subset based on the second partition value.

### Claim 2 (depends on 1)

The method of claim 1, wherein flagging, for each of the plurality of groups, at least one data structure associated with the group based on the portion of the first partition value allocated to the group comprises:
ranking, based on an audience-related criterion, each data structure associated with the group;
identifying a plurality of ranked data structures having the highest rankings of each data structure associated with the group; and
flagging each of the identified plurality of ranked data structures, wherein a sum of budget weights associated with each of the identified plurality of ranked data structures is less than or equal to the portion of the first partition value allocated to the group.

### Claim 3 (depends on 1)

The method of claim 1, wherein flagging at least one data structure within the subset based on the second partition value comprises:
ranking, based on an audience-related criterion, each unflagged data structure of the plurality of data structures;
identifying a plurality of ranked data structures having the highest rankings of each data structure of the plurality of data structures; and
flagging each of the identified plurality of ranked data structures, wherein a sum of budget weights associated with each of the identified plurality of ranked data structures is less than or equal to the second partition value.

### Claim 4 (depends on 1)

The method of claim 1, wherein allocating a portion of the first partition value to each of the plurality of groups comprises allocating a portion of the first partition value equally to each of the plurality of groups.

### Claim 5 (depends on 1)

The method of claim 1, wherein each of the plurality of groups is representative of a time period.

### Claim 6 (depends on 1)

The method of claim 1, wherein each of the plurality of data structures is representative of an available advertising slot.

### Claim 7 (depends on 1)

The method of claim 1, wherein flagging a data structure is indicative of adding an available advertising slot to an advertising campaign plan.

### Claim 8 (depends on 1)

The method of claim 1, wherein the first partition value and the second partition value are user-designated.

### Claim 9 (depends on 1)

The method of claim 1, further comprising generating for display a plurality of cells in a grid arrangement, wherein:
each of the plurality of cells is representative of one of the plurality of data structures, and
each of the plurality of cells is arranged according to a content source and a time period of the data structure represented by the cell.

### Claim 10 (depends on 1)

The method of claim 1, wherein each of the plurality of data structures is associated with a budget weight, and wherein each budget weight is determined based on a pricing tier.

### Claim 11

A system for selecting advertising slots in an advertising campaign, the system comprising:
processing circuitry, wherein the processing circuitry is configured to:
receive a user selection of a budget value;
store the budget value in a memory;
partition the budget value into a first partition value and a second partition value, wherein each of the first and second partition values is stored in the memory;
store a plurality of data structures in the memory;
define a plurality of groups, wherein each of the plurality of data structures is associated with one of the plurality of groups;
allocate a portion of the first partition value to each of the plurality of groups;
flag, for each of the plurality of groups, at least one data structure associated with the group based on the portion of the first partition value allocated to the group;
identify a subset of unflagged data structures within the plurality of data structures; and
flag at least one data structure within the subset based on the second partition value.

### Claim 12 (depends on 11)

The system of claim 11, wherein the processing circuitry is further configured to:
rank, based on an audience-related criterion, each data structure associated with the group;
identify a plurality of ranked data structures having the highest rankings of each data structure associated with the group; and
flag each of the identified plurality of ranked data structures, wherein a sum of budget weights associated with each of the identified plurality of ranked data structures is less than or equal to the portion of the first partition value allocated to the group.

### Claim 13 (depends on 11)

The system of claim 11, wherein the processing circuitry is further configured to:
rank, based on an audience-related criterion, each unflagged data structure of the plurality of data structures;
identify a plurality of ranked data structures having the highest rankings of each data structure of the plurality of data structures; and
flag each of the identified plurality of ranked data structures, wherein a sum of budget weights associated with each of the identified plurality of ranked data structures is less than or equal to the second partition value.

### Claim 14 (depends on 11)

The system of claim 11, wherein the processing circuitry is further configured to allocate a portion of the first partition value equally to each of the plurality of groups.

### Claim 15 (depends on 11)

The system of claim 11, wherein each of the plurality of groups is representative of a time period.

### Claim 16 (depends on 11)

The system of claim 11, wherein each of the plurality of data structures is representative of an available advertising slot.

### Claim 17 (depends on 11)

The system of claim 11, wherein flagging a data structure is indicative of adding an available advertising slot to an advertising campaign plan.

### Claim 18 (depends on 11)

The system of claim 11, wherein the first partition value and the second partition value are user-designated.

### Claim 19 (depends on 11)

The system of claim 11, wherein the processing circuitry is further configured to generate for display a plurality of cells in a grid arrangement, wherein:
each of the plurality of cells is representative of one of the plurality of data structures, and
each of the plurality of cells is arranged according to a content source and a time period of the data structure represented by the cell.

### Claim 20 (depends on 11)

The system of claim 11, wherein each of the plurality of data structures is associated with a budget weight, and wherein each budget weight is determined based on a pricing tier.

### Claim at position 21

21-60. (canceled)