Method and a system for delivering messages

• US 8,676,682 B2
• Filed: 06/11/2008
• Issued: 03/18/2014
• Est. Priority Date: 06/14/2007
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Kalliola, Janne
• Primary Examiner(s): Hamilton, Lalita M
• Application Number:
  US12/157,518
• Publication Number:
  US 20080312948A1
• Time in Patent Office: 2,106 Days
• Field of Search: 705/14.41, 705/35, 705/14.49
• US Class Current: 705/35
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0251 Targeted advertisements
• CPC Class Codes: G06Q 30/0267 Wireless devices

Abstract

A system for generating a schedule for use in triggering transmission of message content in a telecommunications network is provided. The system comprises a store for storing profiles of a plurality of recipients, and a plurality of message delivery campaigns with one or more criteria. The campaigns to be executed in relation to a given inventory, which may relate to a predetermined time period, may be arranged into one or more campaign clusters. A suitable allocation method may be used individually for each of said plurality of campaign clusters to allocate, among the plurality of recipients, target recipients for each of the campaign clusters based on campaign criteria and the profiles. The allocation process may be repeated to obtain, for example as high a number of messages as possible with the network resources available without exceeding a predetermined maximum number of messages per any given recipient. After the allocation process is completed, the campaign messages are delivered to the allocated target recipients via a communications network.

Claims

1. A computer implemented method comprising:

allocating, by a processor, campaign messages of a plurality of messaging campaigns to target recipients selected from a plurality of potential recipients based upon a first allocation algorithm that dictates a first order in which messages from each of the plurality of campaigns are allocated, wherein a target recipient for each message is selected by matching campaign criteria associated with the respective messaging campaign to profile data associated with each of the plurality of potential recipients, the resulting allocation creating a first allocation of target recipients;

allocating, by the processor, campaign messages of the plurality of messaging campaigns to target recipients selected from the plurality of potential recipients based upon a second allocation algorithm that dictates a second order in which messages from each of the plurality of campaigns are allocated, wherein a target recipient for each message is selected by matching campaign criteria associated with the respective messaging campaign to profile data associated with each of the plurality of potential recipients, the resulting allocation creating a second allocation of target recipients; and

selecting, by the processor, either the first allocation of target recipients or the second allocation of target recipients based upon which allocation best satisfies a selection criteria indicating a favorable outcome to the plurality of messaging campaigns.

2. The computer implemented method of claim 1, wherein the first allocation algorithm and the second allocation algorithm further dictate a maximum number of messages which can be delivered to each recipient.

3. The computer implemented method of claim 1, wherein the selection criteria accounts for which allocation of target recipients results in more messages being delivered.

4. The computer implemented method of claim 1, wherein the selection criteria accounts for which allocation of target recipients results in a larger number of target recipients receiving messages.

5. The computer implemented method of claim 1, wherein the selection criteria accounts for which allocation of target recipients results in all messages of a campaign being sent.

6. The computer implemented method of claim 1, wherein the selection criteria accounts for which allocation of target recipients results in an even distribution of the messages among recipients.

7. The computer implemented method of claim 1, wherein the selection criteria accounts for which allocation of target recipients results in a higher profit.

8. The computer implemented method of claim 1, wherein the selection criteria accounts for which allocation of target recipients results in the best balance between multiple requirements.

9. The computer implemented method of claim 1, wherein the selection criteria include a time period for which to evaluate a result of the first allocation algorithm and the second allocation algorithm.

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

transmitting the messages of the plurality of messaging campaigns based on the selected allocation of target recipients.

11. The computer implemented method of claim 1, wherein the campaign criteria includes an age range of the recipient.

12. The computer implemented method of claim 1, wherein the campaign criteria includes a specified interest or preference of the recipient.

13. The computer implemented method of claim 1, wherein the plurality of messaging campaigns are evaluated together based on similarity or commonality between campaign criteria.

14. The computer implemented method of claim 1, wherein the plurality of messaging campaigns are evaluated together based on dissimilarity or lack of commonality between campaign criteria.

15. A system comprising:

a processor; and

memory containing instruction that, when executed, causes the processor to;

allocate campaign messages of a plurality of messaging campaigns to target recipients selected from a plurality of potential recipients based upon a first allocation algorithm that dictates a first order in which messages from each of the plurality of campaigns are allocated, wherein a target recipient for each message is selected by matching campaign criteria associated with the respective messaging campaign to profile data associated with each of the plurality of potential recipients, the resulting allocation creating a first allocation of target recipients;

allocate campaign messages of the plurality of messaging campaigns to target recipients selected from the plurality of potential recipients based upon a second allocation algorithm that dictates a second order in which messages from each of the plurality of campaigns are allocated, wherein a target recipient for each message is selected by matching campaign criteria associated with the respective messaging campaign to profile data associated with each of the plurality of potential recipients, the resulting allocation creating a second allocation of target recipients; and

select either the first allocation of target recipients or the second allocation of target recipients based upon which allocation best satisfies a selection criteria indicating a favorable outcome to the plurality of messaging campaigns.

16. The system of claim 15, wherein the first allocation algorithm and the second allocation algorithm further dictate a maximum number of messages which can be delivered to each recipient.

17. The system of claim 15, wherein the selection criteria accounts for which allocation of target recipients results in more messages being delivered.

18. The system of claim 15, wherein the selection criteria accounts for which allocation of target recipients results in a larger number of target recipients receiving messages.

19. The system of claim 15, wherein the selection criteria accounts for which allocation of target recipients results in all messages of a campaign being sent.

20. The system of claim 15, wherein the selection criteria accounts for which allocation of target recipients results in an even distribution of the messages among recipients.

21. The system of claim 15, wherein the selection criteria accounts for which allocation of target recipients results in a higher profit.

22. The system of claim 15, wherein the selection criteria accounts for which allocation of target recipients results in the best balance between multiple requirements.

23. The system of claim 15, wherein the selection criteria include a time period for which to evaluate a result of the first allocation algorithm and the second allocation algorithm.

24. The system of claim 15, wherein the instructions further cause the processor to:

transmit the messages of the plurality of messaging campaigns based on the selected allocation of target recipients.

25. The system of claim 15, wherein the campaign criteria includes an age range of the recipient.

26. The system of claim 15, wherein the campaign criteria includes a specified interest or preference of the recipient.

27. The system of claim 15, wherein the plurality of messaging campaigns are evaluated together based on similarity or commonality between campaign criteria.

28. The system of claim 15, wherein the plurality of messaging campaigns are evaluated together based on dissimilarity or lack of commonality between campaign criteria.

29. A non-transitory computer-readable medium having computer executable instructions stored thereon that, when executed, cause a computing device to:

allocate campaign messages of a plurality of messaging campaigns to target recipients selected from a plurality of potential recipients based upon a first allocation algorithm that dictates a first order in which messages from each of the plurality of campaigns are allocated, wherein a target recipient for each message is selected by matching campaign criteria associated with the respective messaging campaign to profile data associated with each of the plurality of potential recipients, the resulting allocation creating a first allocation of target recipients;

allocate campaign messages of the plurality of messaging campaigns to target recipients selected from the plurality of potential recipients based upon a second allocation algorithm that dictates a second order in which messages from each of the plurality of campaigns are allocated, wherein a target recipient for each message is selected by matching campaign criteria associated with the respective messaging campaign to profile data associated with each of the plurality of potential recipients, the resulting allocation creating a second allocation of target recipients; and

select either the first allocation of target recipients or the second allocation of target recipients based upon which allocation best satisfies a selection criteria indicating a favorable outcome to the plurality of messaging campaigns.