IP Library Granted Patent US 12,192,553
Granted Patent B1
US 12,192,553 · App. 18/368,793 · Granted Jan 7, 2025

Content delivery optimization based on predicted effectiveness of linear content schedule

Inventors: Ricardo Vasquez-Sierra (San Jose, CA); Thomas Musser (Somerville, MA); Mithal Kothari (San Jose, CA); Vinay Shetty (Santa Clara, CA); Bhaskar Parvathaneni (Cupertino, CA); Soudipta Das (San Jose, CA); Scott Huang (New York, NY); Varun Himamshu (Melrose, MA)
Assignee: Roku, Inc.
H04N21/26208H04N21/23424H04N21/812
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 12,192,553
App. No.
18/368,793
Granted
Jan 7, 2025
Kind
B1
Abstract

Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for determining an number of slots for achieving a desired reach specified in a media content delivery schedule. The system, apparatus, article of manufacture, method, and/or computer program product aspects is designed with a simulation framework tuned to predict an estimate the needed number of slots based on a reach specified in the delivery schedule.

Claims (107)

1. A computer-implemented method for determining an optimized content schedule, comprising:

inputting a content schedule into a relationship model, wherein the content schedule is associated with linear content, wherein the linear content is to be delivered to a media device associated with a household, wherein the content schedule comprises a target impression for supplemental content within the linear content, wherein the content schedule is further associated with a content provider, a network channel, and a daypart, and wherein the target impression reflects a number of desired impressions of the supplemental content within the linear content;

outputting, by the relationship model, a number of delivery slots for the target impression, the network channel, and the daypart;

generating an estimated reach based on the number of delivery slots, the network channel, and the daypart;

generating an optimized linear content schedule based on the estimated reach and the content schedule; and

delivering the linear content via the network channel to the media device associated with the household based on the optimized linear content schedule.

2. The computer-implemented method of claim 1 , wherein the optimized linear content schedule comprises a gross ratings points (GRP) schedule.

3. The computer-implemented method of claim 1 , wherein the content provider is an advertiser and the supplemental content is advertising content.

4. The computer-implemented method of claim 1 , wherein generating the linear content further comprises:

identifying slots in the linear content corresponding to the number of delivery slots; and

inserting the supplemental content in the identified slots.

5. The computer-implemented method of claim 1 , wherein the generating the estimated reach comprises the steps of:

estimating a reach probability of the supplemental content for the network channel and the daypart based on historical performance data associated with the network channel and the daypart;

generating the estimated reach of the supplemental content based on the reach probability and a range of spots available for the network channel and the daypart;

generating a reach model reflecting a relationship between the estimated reach of the supplemental content and the range of spots; and

determining the number of delivery slots for the target impression, the network channel, and the daypart, based on the relationship between the estimated reach of the supplemental content and the range of spots.

6. The computer-implemented method of claim 5 , wherein the reach probability is calculated based on a ratio:

p

household

network

,

daypart

=

impressions

household

network

,

dayport

spots

max

network

,

daypart

where p household network, daypart reflects the reach probability, impressions household network, daypart represents a number of exposures to the supplemental content by the household for the network channel and the daypart, and spots max network, daypart represents a maximum number of spots available for the network channel in the daypart.

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

adjusting the optimized linear content schedule based on the number of delivery slots.

8. A media device, comprising:

at least one memory; and

at least one processor coupled to the at least one memory and configured to perform operations comprising:

inputting a content schedule into a relationship model, wherein the content schedule is associated with linear content, wherein the linear content is to be delivered to a media device associated with a household, wherein the content schedule comprises a target impression for supplemental content within the linear content, wherein the content schedule is further associated with a content provider, a network channel, and a daypart, and wherein the target impression reflects a number of desired impressions of the supplemental content within the linear content;

outputting, by the relationship model, a number of delivery slots for the target impression, the network channel, and the daypart;

generating an estimated reach based on the number of delivery slots, the network channel, and the daypart;

generating an optimized linear content schedule based on the estimated reach and the content schedule; and

delivering the linear content via the network channel to the media device associated with the household based on the optimized linear content schedule.

9. The media device of claim 8 , wherein the optimized linear content schedule comprises a gross ratings points (GRP) schedule.

10. The media device of claim 8 , wherein the content provider is an advertiser and the supplemental content is advertising content.

11. The media device of claim 8 , wherein to generate the linear content, the at least one processor is further configured to:

identify slots in the linear content corresponding to the number of delivery slots; and

insert the supplemental content in the identified slots.

12. The media device of claim 8 , wherein to generate the estimated reach, the at least one processor is further configured to:

estimate a reach probability of the supplemental content for the network channel and the daypart based on historical performance data associated with the network channel and the daypart;

generate the estimated reach of the supplemental content based on the reach probability and a range of spots available for the network channel and the daypart;

generate a reach model reflecting a relationship between the estimated reach of the supplemental content and the range of spots; and

determine the number of delivery slots for the target impression, the network channel, and the daypart, based on the relationship between the estimated reach of the supplemental content and the range of spots.

13. The media device of claim 12 , wherein the reach probability is calculated based on a ratio:

p

household

network

,

daypart

=

impressions

household

network

,

dayport

spots

max

network

,

daypart

where p household network, daypart reflects the reach probability, impressions household network, daypart represents a number of exposures to the supplemental content by the household for the network channel and the daypart, and spots max network, daypart represents a maximum number of spots available for the network channel in the daypart.

14. The media device of claim 8 , wherein the at least one processor is further configured to adjust the optimized linear content schedule based on the number of delivery slots.

15. A non-transitory computer-readable medium having instructions stored thereon that, when executed by at least one computing device, cause the at least one computing device to perform operations comprising:

inputting a content schedule into a relationship model, wherein the content schedule is associated with linear content, wherein the linear content is to be delivered to a media device associated with a household, wherein the content schedule comprises a target impression for supplemental content within the linear content, wherein the content schedule is further associated with a content provider, a network channel, and a daypart, and wherein the target impression reflects a number of desired impressions of the supplemental content within the linear content;

outputting, by the relationship model, a number of delivery slots for the target impression, the network channel, and the daypart;

generating an estimated reach based on the number of delivery slots, the network channel, and the daypart;

generating an optimized linear content schedule based on the estimated reach and the content schedule; and

delivering the linear content via the network channel to the media device associated with the household based on the optimized linear content schedule.

16. The non-transitory computer-readable medium of claim 15 , wherein the content schedule comprises a gross ratings points (GRP) schedule.

17. The non-transitory computer-readable medium of claim 15 , wherein the content provider is an advertiser and the supplemental content is advertising content.

18. The non-transitory computer-readable medium of claim 15 , wherein generating the linear content further comprises:

identifying slots in the linear content corresponding to the number of delivery slots; and

inserting the supplemental content in the identified slots.

19. The non-transitory computer-readable medium of claim 15 , wherein generating the estimated reach comprises:

estimating a reach probability of the supplemental content for the network channel and the daypart based on historical performance data associated with the network channel and the daypart;

generating an estimated reach of the supplemental content based on the reach probability and a range of spots available for the network channel and the daypart;

generating a reach model reflecting a relationship between the estimated reach of the supplemental content and the range of spots; and

determining the number of delivery slots for the target impression, the network channel, and the daypart, based on the relationship between the estimated reach of the supplemental content and the range of spots.

20. The non-transitory computer-readable medium of claim 19 , wherein the reach probability is calculated based on a ratio:

p

household

network

,

daypart

=

impressions

household

network

,

dayport

spots

max

network

,

daypart

where p household network, daypart reflects the reach probability, impressions household network, daypart represents a number of exposures to the supplemental content by the household for the network channel and the daypart, and spots max network, daypart represents a maximum number of spots available for the network channel in the daypart.

Assignments (2)
SECURITY INTEREST Recorded Sep 18, 2024
From: ROKU, INC.
To: CITIBANK, N.A.
Reel/Frame 068982/0377 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 21, 2023
From: VASQUEZ-SIERRA, RICARDO; MUSSER, THOMAS; KOTHARI, MITHAL; SHETTY, VINAY; PARVATHANENI, BHASKAR; DAS, SOUDIPTA; HUANG, SCOTT; HIMAMSHU, VARUN
To: ROKU, INC.
Reel/Frame 064981/0242 →
References Cited (15)
US 9501783B2 · Hood · 2016 [cited by examiner]
US 10445766B1 · Barbier · 2019 [cited by examiner]
US 11265602B2 · Malhotra · 2022 [cited by examiner]
US 11336940B1 · Pinkney · 2022 [cited by examiner]
US 20090187932A1 · Rathburn · 2009 [cited by examiner]
US 20120253922A1 · Baluja · 2012 [cited by examiner]
US 20130205339A1 · Haberman · 2013 [cited by examiner]
US 20130339126A1 · Cui · 2013 [cited by examiner]
US 20140100944A1 · Zhu · 2014 [cited by examiner]
US 20140196081A1 · Emans · 2014 [cited by examiner]
US 20170034594A1 · Francis · 2017 [cited by examiner]
US 20180189821A1 · Masson · 2018 [cited by examiner]
US 20190104343A1 · Tsivin · 2019 [cited by examiner]
US 20200245035A1 · Sandholm · 2020 [cited by examiner]
US 20220201350A1 · Carbajal Orozco · 2022 [cited by examiner]