IP Library Granted Patent US 11,704,132
Granted Patent B2
US 11,704,132 · App. 17/353,345 · Granted Jul 18, 2023

Computer resource management based on prioritization of computer executable events

Inventors: Frank Lo (Boston, MA); Brandon Joseph Ward (Brookline, MA); Alexander John Krusz (Cambridge, MA); Brendan Thompson Grove (Brookline, MA)
Assignee: DRAFTKINGS, INC.
G06F9/44G06F40/106G06N5/02G06F15/16G06Q10/02G06Q20/085G06Q50/34G07F17/3237G07F17/3288H04L63/102
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 11,704,132
App. No.
17/353,345
Granted
Jul 18, 2023
Kind
B2
Abstract

Systems and methods directed to managing computer resource allocation by monitoring signals indicating demand for services utilizing computer resources are described. A method includes maintaining, for each first event of first events, historical registration data and respective parameter values of the first event and identifying, for a second event having an open registration status, respective parameter values of the second event, and registration data for the second event. The method includes computing a similarity score between the second event and each first event of the plurality of first events, based on the respective parameter values of the first event and the second event and the registration data of the second event and the historical registration data of the first event, generating, for the second event, a projected number of entities based on determined information and determining a ranking of the second event.

Claims (53)

1. A method, comprising:

maintaining, by one or more processors coupled to memory, for each historic event of a plurality of historic events managed by the one or more processors, historic registration data that identifies a number of entries of the historic event and a historic parameter value for the historic event;

identifying, by the one or more processors, a first parameter value of a first open event of a plurality of open events and a current number of registrants for the first open event;

generating, by the one or more processors, a similarity score between each historic event of the plurality of historic events and the first open event based on i) the historic registration data of the historic event and registration data of the first open event and ii) the historic parameter value for the historic event and the first parameter value of the first open event;

selecting, by the one or more processors, a subset of the plurality of historic events based on the similarity score for each of the plurality of historic events of the subset exceeding a threshold similarity score value;

generating, by the one or more processors, a projected number of entities for the first open event based on i) the registration data of the first open event and ii) the historic registration data of the subset of the plurality of historic events; and

storing, by the one or more processors, in one or more data structures, an association between the projected number of entities and the first open event.

2. The method of claim 1 , wherein generating the projected number of entities for the first open event is further based on the historic registration data of the subset of the plurality of historic events at a plurality of times and the registration data of the first open event at the plurality of times.

3. The method of claim 1 , further comprising:

maintaining, by the one or more processors, for each open event of the plurality of open events having an open registration status, an association between the open event and a respective content item of a plurality of content items;

determining, by the one or more processors, based on the projected number of entities, a ranking of the first open event relative to one or more other open events of the plurality of open events;

selecting, by the one or more processors, a content item of the plurality of content items based on the ranking of the plurality of open events; and

providing, by the one or more processors, the content item for display at a client device.

4. The method of claim 3 , further comprising;

determining, by the one or more processors, a presentation layout based on the ranking of the first open event relative to the one or more other open events of the plurality of open events; and

providing, by the one or more processors, the presentation layout for display.

5. The method of claim 4 , further comprising:

determining, by the one or more processors, positions for different events within the presentation layout for an event display based on the ranking; and

displaying, by the one or more processors, events within the presentation layout for the event display based on the positions.

6. The method of claim 1 , further comprising:

determining, by the one or more processors, a time at which to generate a second open event based on the projected number of entities; and

generating, by the one or more processors, the second open event at the time.

7. The method of claim 6 , wherein determining the time at which to generate the second open event is further based on a policy for generating new events, wherein the policy comprises an event schedule.

8. The method of claim 1 , wherein generating the similarity score for each historic event of the plurality of historic events further comprises calculating, by the one or more processors, a similarity value between the historic parameter value for the historic event and the first parameter value of the first open event.

9. The method of claim 1 , wherein generating the projected number of entities further comprises generating, by the one or more processors, one or more entity profile parameters for the first open event.

10. The method of claim 1 , wherein generating the similarity score is further based on aggregating similarity scores for each open event of the plurality of open events based on a weighted sum of respective predetermined weights corresponding to each of the plurality of open events.

11. A system, comprising:

one or more processors coupled to memory, the one or more processors configured to:

maintain, for each historic event of a plurality of historic events managed by the one or more processors, historic registration data that identifies a number of entries of the historic event and a historic parameter value for the historic event;

identify a first parameter value of a first open event of a plurality of open events and a current number of registrants for the first open event;

generate a similarity score between each historic event of the plurality of historic events and the first open event based on i) the historic registration data of the historic event and registration data of the first open event and ii) the historic parameter value for the historic event and the first parameter value of the first open event;

select a subset of the plurality of historic events based on the similarity score for each of the plurality of historic events of the subset exceeding a threshold similarity score value;

generate a projected number of entities for the first open event based on i) the registration data of the first open event and ii) the historic registration data of the subset of the plurality of historic events; and

store, in one or more data structures, an association between the projected number of entities and the first open event.

12. The system of claim 11 , wherein the one or more processors are further configured to generate the projected number of entities for the first open event further based on the historic registration data of the subset of the plurality of historic events at a plurality of times and the registration data of the first open event at the plurality of times.

13. The system of claim 11 , wherein the one or more processors are further configured to:

maintain, for each open event of the plurality of open events having an open registration status, an association between the open event and a respective content item of a plurality of content items;

determine, based on the projected number of entities, a ranking of the first open event relative to one or more other open events of the plurality of open events;

select a content item of the plurality of content items based on the ranking of the plurality of open events; and

provide the content item for display at a client device.

14. The system of claim 13 , wherein the one or more processors are further configured to:

determine a presentation layout based on the ranking of the first open event relative to the one or more other open events of the plurality of open events; and

provide the presentation layout for display.

15. The system of claim 14 , wherein the one or more processors are further configured to:

determine positions for different events within the presentation layout for an event display based on the ranking; and

display events within the presentation layout for the event display based on the positions.

16. The system of claim 11 , wherein the one or more processors are further configured to:

determine a time at which to generate a second open event based on the projected number of entities; and

generate the second open event at the time.

17. The system of claim 16 , wherein the one or more processors are further configured to determine the time at which to generate the second open event further based on a policy for generating new events, wherein the policy comprises an event schedule.

18. The system of claim 11 , wherein to generate the similarity score, the one or more processors are further configured to calculate a similarity value between the historic parameter value for each historic event and the first parameter value of the first open event.

19. The system of claim 11 , wherein to generate the projected number of entities, the one or more processors are further configured to generate one or more entity profile parameters for the first open event.

20. The system of claim 11 , wherein the one or more processors are further configured to generate the similarity score further based on a weighted sum of respective predetermined weights corresponding to each of the plurality of open events.

Assignments (5)
RELEASE OF SECURITY INTEREST Recorded Nov 7, 2024
From: BANC OF CALIFORNIA (FORMERLY KNOWN AS PACIFIC WESTERN BANK)
To: DK CROWN HOLDINGS INC.
Reel/Frame 069315/0578 →
SECURITY INTEREST Recorded Nov 7, 2024
From: DK CROWN HOLDINGS INC.; JACKPOCKET LLC
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 069320/0109 →
CHANGE OF NAME Recorded Oct 3, 2023
From: DRAFTKINGS, INC.
To: DK CROWN HOLDINGS INC.
Reel/Frame 065103/0263 →
SECURITY INTEREST Recorded Jan 3, 2023
From: DK CROWN HOLDINGS INC.
To: PACIFIC WESTERN BANK
Reel/Frame 062266/0013 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2021
From: LO, FRANK; WARD, BRANDON JOSEPH; KRUSZ, ALEXANDER JOHN; GROVE, BRENDAN THOMPSON
To: DRAFTKINGS, INC.
Reel/Frame 056898/0778 →