Method and a system for delivering messages

• US 8,799,123 B2
• Filed: 04/28/2011
• Issued: 08/05/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:
  US13/096,622
• Publication Number:
  US 20110202408A1
• Time in Patent Office: 1,195 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:

determining, by a processor, a first allocation outcome of allocating recipients from a pool of potential recipients to receive messages from a first messaging campaign according to a first allocation algorithm that dictates a first order in which to allocate the recipients to receive the messages from the first messaging campaign, wherein the first messaging campaign;

is associated with a first campaign goal, and

dictates a set of recipient profile parameters for selecting recipients to receive messages from the first messaging campaign;

determining, by the processor, a second allocation outcome of allocating recipients from the pool of potential recipients to receive messages from the first messaging campaign according to a second allocation algorithm that dictates a second order, different than the first order, in which to allocate the recipients to receive the messages from the first messaging campaign, wherein the first allocation outcome and the second allocation outcome are different as a result of the first order and the second order being different;

determining, by the processor, that the first allocation algorithm performed best at achieving the first campaign goal based on an evaluation of the first allocation outcome and the second allocation outcome; and

allocating, by the processor, recipients from a second pool of potential recipients to receive messages from a subsequent messaging campaign according to the first allocation algorithm when the subsequent messaging campaign is associated with the first campaign goal.

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

transmitting the messages from the first messaging campaign based upon the allocation algorithm that performed best at achieving the campaign goal.

3. The computer implemented method of claim 2, further comprising:

receiving feedback regarding the transmitted messages from the recipients to which messages were transmitted.

4. The computer implemented method of claim 1, wherein the campaign goal is to deliver the maximum number of messages from the first messaging campaign.

5. The computer implemented method of claim 1, wherein the campaign goal is to deliver messages from the first messaging campaign to the maximum number of recipients.

6. The computer implemented method of claim 1, wherein the campaign goal is to maximize profit.

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

storing data indicative of the first allocation outcome and the second allocation outcome.

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

9. The computer implemented method of claim 1, wherein each individual recipient from the pool of potential recipients is associated with a recipient profile that specifies the maximum number messages which can be delivered to the respective recipient.

10. A system comprising:

a processor; and

a memory containing instructions that, when executed, cause the processor to;

determine a first allocation outcome of allocating recipients from a pool of potential recipients to receive messages from a first messaging campaign according to a first allocation algorithm that dictates a first order in which to allocate the recipients to receive the messages from the first messaging campaign, wherein the first messaging campaign;

dictates a set of recipient profile parameters for selecting recipients to receive messages from the first messaging campaign;

determine a second allocation outcome of allocating recipients from the pool of potential recipients to receive messages from first messaging campaign according to a second allocation algorithm that dictates a second order, different than the first order, in which to allocate the recipients to receive the messages from the first messaging campaign, wherein the first allocation outcome and the second allocation outcome are different as a result of the first order and the second order being different;

determine that the first allocation algorithm performed best at achieving the first campaign goal based on an evaluation of the first allocation outcome and the second allocation outcome; and

allocate, by the processor, recipients from a second pool of potential recipients to receive messages from a subsequent messaging campaign according to the first allocation algorithm when the subsequent messaging campaign is associated with the first campaign goal.

11. The system of claim 10, wherein the instructions further cause the processor to:

transmit the messages from the first messaging campaign based upon the allocation algorithm that performed best at achieving the campaign goal.

12. The system of claim 11, wherein the instructions further cause the processor to:

receive feedback regarding the transmitted messages from the recipients to which messages were transmitted.

13. The system of claim 10, wherein the campaign goal is to deliver the maximum number of messages from the first messaging campaign.

14. The system of claim 10, wherein the campaign goal is to deliver messages from the first messaging campaign to the maximum number of recipients.

15. The system of claim 10, wherein the campaign goal is to maximize profit.

16. The system of claim 10, wherein the instructions further cause the processor to:

store data indicative of the first allocation outcome and the second allocation outcome.

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

18. The system of claim 10, wherein each individual recipient from the pool of potential recipients is associated with a recipient profile that specifies the maximum number messages which can be delivered to the respective recipient.

19. A non-transitory computer-readable medium containing instructions that, when executed, cause a computing device to:

determine a first allocation outcome of allocating recipients from a pool of potential recipients to receive messages from a first messaging campaign according to a first allocation algorithm that dictates a first order in which to allocate the recipients to receive the messages from the first messaging campaign, wherein the first messaging campaign;

dictates a set of recipient profile parameters for selecting recipients to receive messages from the first messaging campaign;

determine a second allocation outcome of allocating recipients from the pool of potential recipients to receive messages from first messaging campaign according to a second allocation algorithm that dictates a second order, different than the first order, in which to allocate the recipients to receive the messages from the first messaging campaign, wherein the first allocation outcome and the second allocation outcome are different as a result of the first order and the second order being different;

determine that the first allocation algorithm performed best at achieving the first campaign goal based on an evaluation of the first allocation outcome and the second allocation outcome; and

allocate, by the processor, recipients from a second pool of potential recipients to receive messages from a subsequent messaging campaign according to the first allocation algorithm when the subsequent messaging campaign is associated with the first campaign goal.

20. The non-transitory computer-readable medium of claim 19, wherein the instructions further cause the computing device to:

transmit the messages from the first messaging campaign based upon the allocation algorithm that performed best at achieving the campaign goal.

21. The non-transitory computer-readable medium of claim 20, wherein the instructions further cause the computing device to:

receive feedback regarding the transmitted messages from the recipients to which messages were transmitted.

22. The non-transitory computer-readable medium of claim 19, wherein the campaign goal is to deliver the maximum number of messages from the first messaging campaign.

23. The non-transitory computer-readable medium of claim 19, wherein the campaign goal is to deliver messages from the first messaging campaign to the maximum number of recipients.

24. The non-transitory computer-readable medium of claim 19, wherein the campaign goal is to maximize profit.

25. The non-transitory computer-readable medium of claim 19, wherein the instructions further cause the computing device to:

store data indicative of the first allocation outcome and the second allocation outcome.

26. The non-transitory computer-readable medium of claim 19, wherein the first allocation algorithm and the second allocation algorithm dictate a maximum number of messages which can be delivered to each recipient.

27. The non-transitory computer-readable medium of claim 19, wherein each individual recipient from the pool of potential recipients is associated with a recipient profile that specifies the maximum number messages which can be delivered to the respective recipient.